Consider the following two grammars G1 and G2:
1: → | 2: → | | ∈
→ |
→
For each grammar, identify two strings that can be parsed. Are the grammars G1 and
G2 ambiguous? Justify your answer.
Answers
Answered by
1
Answer:
oooooooooooooooooooooooooooooooooooooooooooo
Similar questions