11,953 views

3 Answers

Best answer
12 votes
12 votes

A top down parser is LL parser which means Left to Right parsing performing Left most derivation(LL) and a bottom up parser is LR parser with Left to Right parsing performing Right Most Derivation in reverse order (LR)

selected by
2 votes
2 votes

Ans C

*In top down parsing, we just start with the start symbol and compare the RHS of the different productions against the first piece of input to see which of the productions should be used.

*  it parses the input from Left to right.

eg: 

 S -> Ax
    A -> a

For an input ax Top down parser will do parsing as

     S
    / \
   A   x
   |
   a
0 votes
0 votes
Option C will be right option for it.

Explanation::

LMD always fallow the top down parser.

Bottum up parser fallow the RMD in reverse order.
Answer:

Related questions

12 votes
12 votes
5 answers
1
go_editor asked Jul 6, 2016
10,438 views
Recursive descent parsing is an example ofTop-down parsersBottom-up parsersPredictive parsersNone of the above
8 votes
8 votes
2 answers
2
Arjun asked Jul 6, 2016
3,873 views
A simple two-pass assembler does which of the following in the first pass:Checks to see if the instructions are legal in the current assembly modeIt allocates space for t...
10 votes
10 votes
2 answers
3
ManojK asked Jul 4, 2016
11,687 views
Peephole optimization is form ofLoop optimizationLocal optimizationConstant foldingData flow analysis