In: Computer Science
Consider the following grammar:
S ➝ A B C D
A ➝ a A | c A | ε
B ➝ b B | ε
C ➝ a C | c
D ➝ A | d | ε
Which of the following has two parse trees according to G?
a) a
b) ac -- Correct Answer
c) ε
d) bc
e) b
IF YOU HAVE ANY DOUBT YOU CAN COMMENT
LIKE IT IF YOU UNDERSTOOD . LIKE IT PLEASE I NEED YOUR LIKE