4

To answer this, follow the definitions. From Wikipedia (see further references there): The language of a grammar is the set of sentences it builds. A sentence is a sentential form that contains no nonterminals. A sentential form is a member of (Σ ∪ N)*. Σ are terminal symbols, here ∅. N are nonterminal symbols, here {S, A}. Working our way up this list ...


3

As I interpret your question, you propose an alternative theory of syntax to CFG for linguistics. It's a thought, but do you have any evidence? I didn't see any. Don't you think you should have some facts to go on if linguists are to forgo theories like GPSG, based on CFG. What facts of natural language support your view?


2

No natural language is deterministic. What book mentions LR parsers for English? There might be some “controlled languages” based on English that are deterministic, but a broad-coverage parser is always non-deterministic, there are typically many syntactic ambiguities that get resolved later at the level of semantics or pragmatics. In actual fact, many ...


1

If you are thinking of formal language theory to compare programming languages and human languages, make sure you compare apples to apples. Don't mix up what a program can compute with what grammar rules the program text must follow. To say that a language is in a given syntax class means that well-formed strings (a program) can be parsed using a grammar ...


1

The situation with natural languages is more convoluted because the analysis of sentences crucially depends on background knowledge, which makes use of metaphors, metonymy etc. widespread. Consider the sentence The Galway office called. The maximisation ("the largest amount of information") is achieved by compacting the sentence, i.e. leaving out what can be ...


Only top voted, non community-wiki answers of a minimum length are eligible