Left recursion

In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language by the fact that it decomposes into a string from that same language (on the left) and a suffix (on the right). For instance, ${\displaystyle 1+2+3}$ can be recognized as a sum because it can be broken into ${\displaystyle 1+2}$, also a sum, and ${\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 (in the case of direct left recursion) or can be made itself by some sequence of substitutions (in the case of indirect left recursion).

Definition

A grammar is left-recursive if and only if there exists a nonterminal symbol ${\displaystyle A}$ that can derive to a sentential form with itself as the leftmost symbol. ^[1] Symbolically,

${\displaystyle A\Rightarrow ^{+}A\alpha }$,

where ${\displaystyle \Rightarrow ^{+}}$ indicates the operation of making one or more substitutions, and ${\displaystyle \alpha }$ is any sequence of terminal and nonterminal symbols.

Direct left recursion

Direct left recursion occurs when the definition can be satisfied with only one substitution. It requires a rule of the form

${\displaystyle A\to A\alpha }$

where ${\displaystyle \alpha }$ is a sequence of nonterminals and terminals . For example, the rule

${\displaystyle {\mathit {Expression}}\to {\mathit {Expression}}+{\mathit {Term}}}$

is directly left-recursive. A left-to-right recursive descent parser for this rule might look like

voidExpression(){Expression();match('+');Term();}

and such code would fall into infinite recursion when executed.

Indirect left recursion

Indirect left recursion occurs when the definition of left recursion is satisfied via several substitutions. It entails a set of rules following the pattern

${\displaystyle A_{0}\to \beta _{0}A_{1}\alpha _{0}}$

${\displaystyle A_{1}\to \beta _{1}A_{2}\alpha _{1}}$

${\displaystyle \cdots }$

${\displaystyle A_{n}\to \beta _{n}A_{0}\alpha _{n}}$

where ${\displaystyle \beta _{0},\beta _{1},\ldots ,\beta _{n}}$ are sequences that can each yield the empty string, while ${\displaystyle \alpha _{0},\alpha _{1},\ldots ,\alpha _{n}}$ may be any sequences of terminal and nonterminal symbols at all. Note that these sequences may be empty. The derivation

${\displaystyle A_{0}\Rightarrow \beta _{0}A_{1}\alpha _{0}\Rightarrow ^{+}A_{1}\alpha _{0}\Rightarrow \beta _{1}A_{2}\alpha _{1}\alpha _{0}\Rightarrow ^{+}\cdots \Rightarrow ^{+}A_{0}\alpha _{n}\dots \alpha _{1}\alpha _{0}}$

then gives ${\displaystyle A_{0}}$ as leftmost in its final sentential form.

Uses

Left recursion is commonly used as an idiom for making operations left-associative: that an expression a+b-c-d+e is evaluated as (((a+b)-c)-d)+e. In this case, that evaluation order could be achieved as a matter of syntax via the three grammatical rules

${\displaystyle {\mathit {Expression}}\to {\mathit {Term}}}$

${\displaystyle {\mathit {Expression}}\to {\mathit {Expression}}+{\mathit {Term}}}$

${\displaystyle {\mathit {Expression}}\to {\mathit {Expression}}-{\mathit {Term}}}$

These only allow parsing the ${\displaystyle {\mathit {Expression}}}$a+b-c-d+e as consisting of the ${\displaystyle {\mathit {Expression}}}$a+b-c-d and ${\displaystyle {\mathit {Term}}}$e, where a+b-c-d in turn consists of the ${\displaystyle {\mathit {Expression}}}$a+b-c and ${\displaystyle {\mathit {Term}}}$d, while a+b-c consists of the ${\displaystyle {\mathit {Expression}}}$a+b and ${\displaystyle {\mathit {Term}}}$c, etc.

Removing left recursion

Left recursion often poses problems for parsers, either because it leads them into infinite recursion (as in the case of most top-down parsers) or because they expect rules in a normal form that forbids it (as in the case of many bottom-up parsers ^{[ clarification needed ]}). Therefore, a grammar is often preprocessed to eliminate the left recursion.

Removing direct left recursion

The general algorithm to remove direct left recursion follows. Several improvements to this method have been made. ^[2] For a left-recursive nonterminal ${\displaystyle A}$, discard any rules of the form ${\displaystyle A\rightarrow A}$ and consider those that remain:

${\displaystyle A\rightarrow A\alpha _{1}\mid \ldots \mid A\alpha _{n}\mid \beta _{1}\mid \ldots \mid \beta _{m}}$

where:

• each ${\displaystyle \alpha }$ is a nonempty sequence of nonterminals and terminals, and
• each ${\displaystyle \beta }$ is a sequence of nonterminals and terminals that does not start with ${\displaystyle A}$.

Replace these with two sets of productions, one set for ${\displaystyle A}$:

${\displaystyle A\rightarrow \beta _{1}A^{\prime }\mid \ldots \mid \beta _{m}A^{\prime }}$

and another set for the fresh nonterminal ${\displaystyle A'}$ (often called the "tail" or the "rest"):

${\displaystyle A^{\prime }\rightarrow \alpha _{1}A^{\prime }\mid \ldots \mid \alpha _{n}A^{\prime }\mid \epsilon }$

Repeat this process until no direct left recursion remains.

As an example, consider the rule set

${\displaystyle {\mathit {Expression}}\rightarrow {\mathit {Expression}}+{\mathit {Expression}}\mid {\mathit {Integer}}\mid {\mathit {String}}}$

This could be rewritten to avoid left recursion as

${\displaystyle {\mathit {Expression}}\rightarrow {\mathit {Integer}}\,{\mathit {Expression}}'\mid {\mathit {String}}\,{\mathit {Expression}}'}$

${\displaystyle {\mathit {Expression}}'\rightarrow {}+{\mathit {Expression}}\,{\mathit {Expression}}'\mid \epsilon }$

Removing all left recursion

The above process can be extended to eliminate all left recursion, by first converting indirect left recursion to direct left recursion on the highest numbered nonterminal in a cycle.

InputsA grammar: a set of nonterminals ${\displaystyle A_{1},\ldots ,A_{n}}$ and their productions

OutputA modified grammar generating the same language but without left recursion

1. For each nonterminal ${\displaystyle A_{i}}$:
   1. Repeat until an iteration leaves the grammar unchanged:
      1. For each rule ${\displaystyle A_{i}\rightarrow \alpha _{i}}$, ${\displaystyle \alpha _{i}}$ being a sequence of terminals and nonterminals:
         1. If ${\displaystyle \alpha _{i}}$ begins with a nonterminal ${\displaystyle A_{j}}$ and ${\displaystyle j<i}$:
            1. Let ${\displaystyle \beta _{i}}$ be ${\displaystyle \alpha _{i}}$ without its leading ${\displaystyle A_{j}}$.
            2. Remove the rule ${\displaystyle A_{i}\rightarrow \alpha _{i}}$.
            3. For each rule ${\displaystyle A_{j}\rightarrow \alpha _{j}}$:
               1. Add the rule ${\displaystyle A_{i}\rightarrow \alpha _{j}\beta _{i}}$.
   2. Remove direct left recursion for ${\displaystyle A_{i}}$ as described above.

Step 1.1.1 amounts to expanding the initial nonterminal ${\displaystyle A_{j}}$ in the right hand side of some rule ${\displaystyle A_{i}\to A_{j}\beta }$, but only if ${\displaystyle j<i}$. If ${\displaystyle A_{i}\to A_{j}\beta }$ was one step in a cycle of productions giving rise to a left recursion, then this has shortened that cycle by one step, but often at the price of increasing the number of rules.

The algorithm may be viewed as establishing a topological ordering on nonterminals: afterwards there can only be a rule ${\displaystyle A_{i}\to A_{j}\beta }$ if ${\displaystyle j>i}$. Note that this algorithm is highly sensitive to the nonterminal ordering; optimizations often focus on choosing this ordering well.

Pitfalls

Although the above transformations preserve the language generated by a grammar, they may change the parse trees that witness strings' recognition. With suitable bookkeeping, tree rewriting can recover the originals, but if this step is omitted, the differences may change the semantics of a parse.

Associativity is particularly vulnerable; left-associative operators typically appear in right-associative-like arrangements under the new grammar. For example, starting with this grammar:

${\displaystyle {\mathit {Expression}}\rightarrow {\mathit {Expression}}\,-\,{\mathit {Term}}\mid {\mathit {Term}}}$

${\displaystyle {\mathit {Term}}\rightarrow {\mathit {Term}}\,*\,{\mathit {Factor}}\mid {\mathit {Factor}}}$

${\displaystyle {\mathit {Factor}}\rightarrow ({\mathit {Expression}})\mid {\mathit {Integer}}}$

the standard transformations to remove left recursion yield the following:

${\displaystyle {\mathit {Expression}}\rightarrow {\mathit {Term}}\ {\mathit {Expression}}'}$

${\displaystyle {\mathit {Expression}}'\rightarrow {}-{\mathit {Term}}\ {\mathit {Expression}}'\mid \epsilon }$

${\displaystyle {\mathit {Term}}\rightarrow {\mathit {Factor}}\ {\mathit {Term}}'}$

${\displaystyle {\mathit {Term}}'\rightarrow {}*{\mathit {Factor}}\ {\mathit {Term}}'\mid \epsilon }$

${\displaystyle {\mathit {Factor}}\rightarrow ({\mathit {Expression}})\mid {\mathit {Integer}}}$

Parsing the string "1 - 2 - 3" with the first grammar in an LALR parser (which can handle left-recursive grammars) would have resulted in the parse tree:

Left-recursive parsing of a double subtraction

This parse tree groups the terms on the left, giving the correct semantics (1 - 2) - 3.

Parsing with the second grammar gives

Right-recursive parsing of a double subtraction

which, properly interpreted, signifies 1 + (-2 + (-3)), also correct, but less faithful to the input and much harder to implement for some operators. Notice how terms to the right appear deeper in the tree, much as a right-recursive grammar would arrange them for 1 - (2 - 3).

Accommodating left recursion in top-down parsing

A formal grammar that contains left recursion cannot be parsed by a LL(k)-parser or other naive recursive descent parser unless it is converted to a weakly equivalent right-recursive form. In contrast, left recursion is preferred for LALR parsers because it results in lower stack usage than right recursion. However, more sophisticated top-down parsers can implement general context-free grammars by use of curtailment. In 2006, Frost and Hafiz described an algorithm which accommodates ambiguous grammars with direct left-recursive production rules. ^[3] That algorithm was extended to a complete parsing algorithm to accommodate indirect as well as direct left recursion in polynomial time, and to generate compact polynomial-size representations of the potentially exponential number of parse trees for highly ambiguous grammars by Frost, Hafiz and Callaghan in 2007. ^[4] The authors then implemented the algorithm as a set of parser combinators written in the Haskell programming language. ^[5]

See also

• Tail recursion

References

1. Notes on Formal Language Theory and Parsing at the Wayback Machine (archived 2007-11-27). James Power, Department of Computer Science National University of Ireland, Maynooth Maynooth, Co. Kildare, Ireland.JPR02
2. Moore, Robert C. (May 2000). "Removing Left Recursion from Context-Free Grammars" (PDF). 6th Applied Natural Language Processing Conference: 249–255.
3. Frost, R.; R. Hafiz (2006). "A New Top-Down Parsing Algorithm to Accommodate Ambiguity and Left Recursion in Polynomial Time". ACM SIGPLAN Notices. 41 (5): 46–54. doi:10.1145/1149982.1149988. S2CID   8006549., available from the author at http://hafiz.myweb.cs.uwindsor.ca/pub/p46-frost.pdf Archived 2015-01-08 at the Wayback Machine
4. Frost, R.; R. Hafiz; P. Callaghan (June 2007). "Modular and Efficient Top-Down Parsing for Ambiguous Left-Recursive Grammars" (PDF). 10th International Workshop on Parsing Technologies (IWPT), ACL-SIGPARSE: 109–120. Archived from the original (PDF) on 2011-05-27.
5. Frost, R.; R. Hafiz; P. Callaghan (January 2008). "Parser Combinators for Ambiguous Left-Recursive Grammars". Practical Aspects of Declarative Languages (PDF). Lecture Notes in Computer Science. Vol. 4902. pp. 167–181. doi:10.1007/978-3-540-77442-6_12. ISBN   978-3-540-77441-9.

External links

• Practical Considerations for LALR(1) Grammars