Show the code that can be generated by a compiler from the given production.

How do you think a compiler translates into machine language, a branch in the parse tree that looks like the diagram given in attached CompilerTranslate.doc? Show the code that can be generated from the production given in the diagram, and the semantic record created for the new nonterminal symbol .

Describe the language defined by the given grammar.

Describe the language defined by the following grammar: :: = | :: = , :: = A

Create BNF grammars for boolean expressions of the specified form.

a. Create a BNF grammar that describes simple Boolean expressions of the form var AND var var OR var where var is one of the symbols w, x, y, and z. b. Modify your grammar from part (a) so that the Boolean expressions can be of the form expr AND expr expr OR expr where expr is either a simple variable (w, x, y, or z) or an expression of the form (var == var) (var < var) (var > var) c. Modify your grammar one more time to allow a Boolean expression to have an arbitrary number of terms connected by either AND or OR. That is, your expressions can be of the form expr AND expr OR expr OR expr AND expr....

Compiler

Please see the attached file.