Construct LL(1) Parsing Table from given CFG

1
Programming Project 2

• Construct LL(1) Parsing Table from given CFG

2
The problem

• Implement a program that, when given a CFG G
• Computes all nullable symbols in G,
• Computes First-Set for all nonterminals
• Computes Follow-Set for all nonterminals, and
• Generates the LL(1) Parsing table for G, and
  determine if it is LL(1).

3

• all supported software for working on eclipse is
  provided in the URL http//xml.cs.nccu.edu.tw/co
  urses/compiler/cp2007/problems/ecproblem2.zip
• The only code you need to modify is the java file
  problem2.LL1Grammar.java file.
• You must use Java class libraries from Java 1.5.0
  or above.

4
Files in ecproblem2.zip

• compiler-problem2 // project root import it to
  eclipse workspace
• test1.cfgtest6.cfg testing grammars
• _textHtmlOutput.html expected results
• doc/ java doc API for all supplied src
• src/ supported source files
• resources/ aux resouce files
• tool/ used tools,
• include javacc jakarta velocity

5
To-DO Tasks

• Unzip and install ecproblem2.zip on eclipse
• Learn to use the supplied Grammar API on src/
  and doc/.html
• Complete LL1Grammar.java
• You may add additional methods/fields to the
  LL1Grammar class or add additional classes to the
  file.
• Compile the whole program by executing
  compile.bat
• Test your results with the given test.cfg files
• by executing run.bat (or all.bat )
• remember to run/compile these batches where they
  are located.
• Summit results (LL1Grammar.java)

6
How to submit problem2

• Email your result file LL1Grammar.java to
• c3_at_cs.nccu.edu.tw
• Notes
• The subject field (???) of your email should be
  filled in with CP2007-PROBLEM2-XXXXXXXX
  where XXXXXXXX is your FULL registration
  number(????).
• Remember to attach your LL1Grammar.java file to
  the email instead of listing it in the email
  content area.
• It WILL NOT be accepted if you do not obey the
  above rules.