Question

given grammar:
X  0 X 0 | 0 X 1 | 1 Y 1
Y  1 | 0
A: Use recursive decent algorithm to implement the given grammar:
B: Parse the following input string: 0 0 1 1 1 1 0

Answer 1

given grammar:

X  0 X 0 | 0 X 1 | 1 Y 1

Y  1 | 0

A: Use recursive decent algorithm to implement the given grammar:

B: Parse the following input string: 0 0 1 1 1 1 0