true false

mDeaILe QUestions-2 points each: Write T or F beside each question. 1. Epsilon productions are more common in LL grammars than in LR grammars. 2. in many situations, modern compilers can generate better code than assembly language programmers can write. 3. For a grammar with no epsilon productions, a top-down parser will predict the production A if the current token T E FIRST(a). a 4. The FORTRAN programming language was the first to have a formal specification of the language grammar. 5. An L-attributed grammar may contain both synthesized and inherited attributes. 6. Operator precedence can be specified in a grammar by incorporating productions which cause the higher-precedence operators to appear "lower" (closer to the leaf nodes) in the parse tree of an expression. 7. A scanner must sometimes "peek" at upcoming characters. 8. Interpreters for functional and logic languages commonly are based on a "read-eval-print loop." 9. A recursive descent parser cannot incorporate semantic attributes. 10. Bottom-up parsers push ("shift") terminal and nonterminal symbols onto a parse stack until the set of symbols S nearest the top of the stack matches the right-hand side of some production, then replaces ("reduces") the matched set of symbols S on the stack with the left-hand side nonterminal symbol of the matched production. Page 2 of2