Using the grammar, draw parse trees for the given expressions: - = - A | B | C - +
Posted: Mon Mar 21, 2022 4:48 pm
Using the grammar, draw parse trees for the given
expressions:
<assign> - <id> = <expr>
<id> - A | B | C
<expr> - <id> + <expr>
|<id> * <expr>
| (<expr>)
| <id>
Expressions:
A=B+C
A = B*(A+C)
A=A*(B+(C*A))
Extend the grammar by / and -
expressions:
<assign> - <id> = <expr>
<id> - A | B | C
<expr> - <id> + <expr>
|<id> * <expr>
| (<expr>)
| <id>
Expressions:
A=B+C
A = B*(A+C)
A=A*(B+(C*A))
Extend the grammar by / and -