Register

consider the following statements

• retagged by
2,433 views
0 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

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · TCP-Fast Retransmit ...Next → · DataStructure-Prims-...
← Previous in category · Is this grammar LL1,...Next in category → · SLR(1) Parser
Position:
Show:

Related questions

3 3 votes
4 4 answers
8.1k
8.1k views
Harit asked Apr 25, 2016
8,140 views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
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 | ε
1 1 vote
1 answers 1 answer
2.4k
2.4k views
radha gogia asked Apr 30, 2018
2,358 views
which of the following statements are correct in context of LR parser ?
1.Class of grammar that will parse using LR method is proper subset of class of grammar that will parse with predictive parser .2. LR Parser can be constructed to recogni...
0 0 votes
1 answers 1 answer
1.5k
1.5k views
Akriti sood asked Dec 18, 2016
1,535 views
Consider the following statements:
Consider the following statements:S1] If a language is decidable then every proper subset of that language is decidable.S2] If A≤m B and B is a regular language then A is...
4 4 votes
2 2 answers
17.7k
17.7k views
Subhrangsu asked Apr 16, 2022
17,746 views
Is the following grammar LL(1) ?
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.