Menu Introduction Overview Bibliography

Lex Theory Practice

Yacc Theory Practice I Practice II

Calculator Description Include File Lex Input Yacc Input Interpreter Compiler Graph

More Lex Strings Reserved Debugging

More Yacc Recursion If-Else Errors Attributes Actions Debugging

A list may be specified with left recursion

list:
      item
      | list ',' item
      ;

or right recursion.

list:
      item
      | item ',' list

If right recursion is used then all items on the list are pushed on the stack. After the last item is pushed we start reducing. With left recursion we never have more than three terms on the stack since we reduce as we go along. For this reason it is advantageous to use left recursion.