In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal according to these rules can eventually lead to a string that includes the same non-terminal again. Otherwise it is called a non-recursive grammar.[1]
For example, a grammar for a context-free language is left recursive if there exists a non-terminal symbol A that can be put through the production rules to produce a string with A (as the leftmost symbol).[2][3]
All types of grammars in the Chomsky hierarchy can be recursive and it is recursion that allows the production of infinite sets of words.[1]
^ abNederhof, Mark-Jan; Satta, Giorgio (2002), "Parsing Non-recursive Context-free Grammars", Proceedings of the 40th Annual Meeting on Association for Computational Linguistics (ACL '02), Stroudsburg, PA, USA: Association for Computational Linguistics, pp. 112–119, doi:10.3115/1073083.1073104.
^Notes on Formal Language Theory and Parsing, James Power, Department of Computer Science National University of Ireland, Maynooth Maynooth, Co. Kildare, Ireland.
^Moore, Robert C. (2000), "Removing Left Recursion from Context-free Grammars", Proceedings of the 1st North American Chapter of the Association for Computational Linguistics Conference (NAACL 2000), Stroudsburg, PA, USA: Association for Computational Linguistics, pp. 249–255.
In computer science, a grammar is informally called a recursivegrammar if it contains production rules that are recursive, meaning that expanding a non-terminal...
language translation tools. A recursivegrammar is a grammar that contains production rules that are recursive. For example, a grammar for a context-free language...
defining the other cases recursively in terms of the simple one. A recursivegrammar is a formal grammar that contains recursive production rules. Recursion...
of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes. A predictive parser is a recursive descent...
expression grammar can be converted directly into a recursive descent parser. Due to the unlimited lookahead capability that the grammar formalism provides...
LL grammars; for parsing, see LL parser or recursive descent parser. Given a natural number k ≥ 0 {\displaystyle k\geq 0} , a context-free grammar G =...
+3{\displaystyle {}+3}, a suitable suffix. In terms of context-free grammar, a nonterminal is left-recursive if the leftmost symbol in one of its productions is itself...
constraints on the productions rules. Note that the set of grammars corresponding to recursive languages is not a member of this hierarchy; these would...
recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers. They are also easy to write. Typical recursive descent...
grammar and which cannot be changed using the rules of the grammar. Applying the rules recursively to a source string of symbols will usually terminate in...
input triggers them. In such cases, the recursive descent parser may default (perhaps unknown to the grammar designer) to one of the possible ambiguous...
ambiguous CFG in polynomial time (Θ(n4) for left-recursivegrammars and Θ(n3) for non left-recursivegrammars). Their top-down parsing algorithm also requires...
some context-free grammars and parsing expression grammarsRecursive descent parser: a top-down parser suitable for LL(k) grammars Shunting-yard algorithm:...
random text from recursivegrammars. A free version is also hosted online. The essays are produced from a formal grammar defined by a recursive transition network...
sequences of symbols taken from a fixed alphabet) is called recursive if it is a recursive subset of the set of all possible finite sequences over the...
C from a grammar described in a PEG, Gives a parser great efficiency by packrat parsing, Supports direct and indirect left-recursivegrammar rules, Generates...
the expressive power of a context-free grammar. A grammar processor that does not support recursivegrammars has the expressive power of a finite state...
In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all...
concept of recursive "nesting" ("every A is eventually followed by a matching B"). A classic example of a problem which a regular grammar cannot handle...
are called recursive. This grammar uses recursive rules to handle repeated math operators. Grammars for complete languages use recursive rules to handle...
A recursive transition network ("RTN") is a graph theoretical schematic used to represent the rules of a context-free grammar. RTNs have application to...
unrestricted grammar, other than each of their left-hand sides being non-empty.: 220 This grammar class can generate arbitrary recursively enumerable languages...
our understanding of syntax while simplifying traditional grammar, thus embracing the recursive nature of language and the hierarchical arrangement of linguistic...
a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable...
Global Information