Assignment 8

• Consider the following grammar:

  
       E -> E or T
       E -> T
       T -> T and NF
       T -> NF
       NF -> not NF 
       NF -> F
       F -> ( E )
       F -> a
  

  1. Transform this grammar into one that does not contain left recursion.
  2. Write a recursive-descent parser for the defined language in a C, C++, Java, Prolog, or Scheme.
  3. For each non-terminal X in the transformed grammar, compute FIRST(X) and FOLLOW(X)
  4. Construct the LL(1) parsing table for the transformed grammar.