Question

For a 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

Top-Down Parsers:

In this Parsing technique we expand the start symbol to the whole program.

Recursive Descent and LL parsers are the Top-Down parsers.

Bottom-Up Parsers:

In this Parsing technique we reduce the whole program to start symbol.

Operator Precedence Parser, LR(0) Parser, SLR Parser, LALR Parser and CLR Parser are the Bottom-Up parsers.