retagged by
2,045 views
0 votes
0 votes

Consider the following statements:
S1: A syntax tree should not have keywords as leaves.
S2: A syntax tree is a condensed form of parse tree.
Which of the above statement/s is/are true?

  1.   Neither S1 nor S2
  2.   Only S2
  3.   Both S1 & S2
retagged by

2 Answers

Related questions

3 votes
3 votes
4 answers
1
Harit asked Apr 25, 2016
5,516 views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?S → aB | aAbA → bAb | aB → aB | ε
2 votes
2 votes
2 answers
3
Subhrangsu asked Apr 16, 2022
8,551 views
Is the following grammar LL(1) ?S→ aABbCD | ϵA→ ASd | ϵB→ Sac| hC | ϵC→ Sf |CgD→ aBD | ϵDraw the LL(1) parsing table for the given grammar.