编译原与实践 第三章 答案.doc

The exercises of Chapter Three 3.2 Given the grammar A→AA|(A)|ε a. Describe the language it generates; b. Show that it is ambiguous. [Solution]: a. Generates a string of balanced parenthesis, including the empty string. b. parse trees of (): AA A A A A ( ) ε ε A( A ( ) ε A 3.3 Given the grammar exp ? exp addop term | term addop ? + | - term ? term mulop factor| factor mulop ? * factor ? ( exp ) | number Write down leftmost derivations, parse trees, and abstract syntax trees for the following expression: a. 3+4*5-6 b. 3*(4-5+6) c. 3-(4+5*6) [Solution]: The leftmost derivations for the expression 3+4*5-6: Exp = exp addop term =exp addop term addop term =term addop term addop term= factor addop term addop term =3 addop term addop term = 3 + term addop term =3+term mulop factor addop term =3+factor mulop factor addop term =3+4 mulop factor addop term = 3+4* factor addop term =3+4*5 addop term = 3+4*5-term= 3+4*5-factor=3+4*5-6 3.5 Write a grammar for Boolean expressions that includes the constants true and false, the operators and, or and not, and parentheses. Be sure to give or a lower precedence than and and and a lower precedence that not and to allow repeated not’s, as in the Boolean expression not not true. Also be sre your grammar is not ambiguous. [solution] bexp→bexp or A | A A→ A and B | B B→ not B | C C→ (bexp) | true | false Ex: not not true boolExp → A → B → not B → not not B → not not C → not not true 3.8 Given the following grammar statement→if-stmt | other | ε if-stmt→ if ( exp ) statement else-part else-part→ else statement | ε exp→ 0 | 1 a. Draw a parse tree for the string if(0) if (1) other else else other b. what is the purpose of the two else’s? The two else’s allow the programmer to associate an else clause with the outmost else, when two if statements are nested and the first does not have an else clause. c. Is similar code permissible in C? Explain. The grammar in C looks like: if-stmt→if ( e