Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
cs-236:homework-4 [2015/09/30 16:49]
egm
cs-236:homework-4 [2015/09/30 16:49] (current)
egm
Line 12: Line 12:
  
 ==Problems== ==Problems==
-# (4 points) Do a brute force search to find a parse tree for the input ''​int / int''​. Use a top-down approach meaning you begin with the start rule (i.e., the first rule), and find a left-derivation. When choosing which rule to expand, go in order of the rules. The ''​int''​ terminal is an integer literal).\\ <E> ::= <T> - <E> | <T>\\ <T> ::= ( <E> ) | int | int / <T>+# (4 points) Do a brute force search to find a parse tree for the input ''​int / int''​. Use a top-down approach meaning you begin with the start rule (i.e., the first rule), and find a left-derivation. When choosing which rule to use in an expansion, go in order of the rules. The ''​int''​ terminal is an integer literal).\\ <E> ::= <T> - <E> | <T>\\ <T> ::= ( <E> ) | int | int / <T>
 # (2 points) Compute the FIRST sets for the following. Compute FOLLOW sets as well for extra credit.\\ <A> ::= <​A><​A>'​+'​ | <​A><​A>'​*'​ | a # (2 points) Compute the FIRST sets for the following. Compute FOLLOW sets as well for extra credit.\\ <A> ::= <​A><​A>'​+'​ | <​A><​A>'​*'​ | a
 # (6 points) For each of the following grammars, build an LL(1) parse table. ​ You may left-factor and/or eliminate left-recursion from your grammars first if needed: # (6 points) For each of the following grammars, build an LL(1) parse table. ​ You may left-factor and/or eliminate left-recursion from your grammars first if needed:
cs-236/homework-4.txt ยท Last modified: 2015/09/30 16:49 by egm
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0