Register

UGC NET CSE | June 2007 | Part 2 | Question: 32

• edited by
268 views
0 votes
0 votes

A Top-down Parse generates:

  1. Right-most derivation
  2. Right-most derivation, in reverse
  3. Left-most derivation
  4. Left-most derivation, in reverse
• edited by
User Avatar

1 Answer

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

OPTION D

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Mar 28, 2020
479 views
UGC NET CSE | June 2007 | Part 2 | Question: 1
The following determiniotic finite automata recognizes: Set of all strings containing $’ab’$ Set of all strings containing $’aab’$ Set of all strings ending in $’abab’$ None of the above
The following determiniotic finite automata recognizes:Set of all strings containing $’ab’$Set of all strings containing $’aab’$Set of all strings ending in $’a...
User Avatar
0 votes
0 votes
0 answers
2
go_editor asked Mar 28, 2020
711 views
UGC NET CSE | June 2007 | Part 2 | Question: 2
Depth ion travels of the following directed graph is: $\text{A B C D E F}$ $\text{A B D E F C}$ $\text{A C E B D F}$ None of the above
Depth ion travels of the following directed graph is:$\text{A B C D E F}$$\text{A B D E F C}$$\text{A C E B D F}$None of the above
User Avatar
0 votes
0 votes
0 answers
3
go_editor asked Mar 28, 2020
1,165 views
UGC NET CSE | June 2007 | Part 2 | Question: 3
The maximum number of nodes in a binary tree of depth $10$: $1024$ $2^{10}-1$ $1000$ None of the above
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
User Avatar
1 votes
1 votes
1 answer
4
go_editor asked Mar 28, 2020
1,277 views
UGC NET CSE | June 2007 | Part 2 | Question: 4
The regular expression given below describes: $r=(1+01)$*$(0+\lambda)$ Set of all string not containing $’11’$ Set of all string not containing $’00’$ Set of all string containing $’01’$ Set of all string ending in $’0’$
The regular expression given below describes:$r=(1+01)$*$(0+\lambda)$Set of all string not containing $’11’$Set of all string not containing $’00’$Set of all stri...
User Avatar
Link Copied!