Tail recursive parser

In computer science, tail recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers. They are also easy to write. Typical recursive descent parsers make parsing left recursive grammars impossible (because of an infinite loop problem). Tail recursive parsers use a node reparenting technique that makes this allowable.

Example
Given an EBNF Grammar such as the following: A simple tail recursive parser can be written much like a recursive descent parser. The typical algorithm for parsing a grammar like this using an abstract syntax tree is:
 * 1) Parse the next level of the grammar and get its output tree, designate it the first tree, F
 * 2) While there is terminating token, T, that can be put as the parent of this node:
 * 3) Allocate a new node, N
 * 4) Set N's current operator as the current input token
 * 5) Advance the input one token
 * 6) Set N's left subtree as F
 * 7) Parse another level down again and store this as the next tree, X
 * 8) Set N's right subtree as X
 * 9) Set F to N
 * 10) Return N

A basic example of this kind of parser in C is shown here. Implementation details have been omitted for simplicity.