EXAMPLE FOR LL PARSING


To explain its working we will consider the following small grammar:
  • S -> F
  • S -> ( S + F )
  • F -> 1

and parse the follwing input:
  • ( 1 + 1 )
Note that there is also a column for the special terminal, represented here as $, that is used to indicate the end of the input stream.