Recent questions tagged tbb-cd-1

Consider the following grammar:$S \rightarrow L = P \mid P$$L \rightarrow ^*P \mid id$$P \rightarrow L$The above grammar is:AmbiguousSLR(1)LALR(1)None of the above

Which grammar causes recursive-descent parser to go into infinite loop?LL(1)Left recursive grammarRight recursive grammarGrammar with left factors

Consider the following syntax directed definition of any desk calculator:$L \rightarrow En \{ \text{print}(E.val) \}$$E \rightarrow E1 + 1 \{ E.val = E1.val + Z.val \}$$E...

In compilers, the type checking is done in:Lexical AnalysisSemantic AnalysisCode Generation PhaseParsing Phase

Consider the following grammar:$S \rightarrow aMd \mid bNd \mid aNe \mid bMe$$M \rightarrow c$$N \rightarrow c$The grammar above is:LR(1) but not LALR(1)LALR(1) but no...

Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...

Which one of the following statements is TRUE?SLR parser has more states than LALR parser.LALR parser has more states than Canonical LR.Canonical LR has fewer states than...

The language which supports _______ needs heap allocation in the runtime environment.Dynamic Data Structure Static Scoping Global Variable Recursion

Which one of the following can be handled by predictive parsers?Left recursionLeft factorsAmbiguityNon-determinism

Consider the following grammar:$Z \rightarrow TZ'$$Z' \rightarrow +TZ' \mid \epsilon$$T \rightarrow Y T '$$T ' \rightarrow ^* YT ' \mid \epsilon$$Y \rightarrow (Z) \mi...

Assume that the SLR(1) parser for a grammar has P1 states, and the CLR(1) parser for the same has P2 states. Which of the following clearly depicts the relationship betwe...

Which one of the following statements is TRUE?SLR parser is more powerful than LALR.LALR parser is more powerful than Canonical LR.Canonical LR is more powerful than LALR...

Which of these is NOT true about Abstract Syntax Tree (AST)?An AST is usually the result of the syntax analysis phase of a compiler.AST has no impact on the final output...

Consider the following grammar: $E' \rightarrow E$$E \rightarrow E + Y \mid Y$$Y \rightarrow Y ^* F \mid F$$F \rightarrow id \mid (E)$How many $LR(0)$ items are there in ...

Consider following Translation Scheme:$S \rightarrow ER$$R \rightarrow ^* E \{ print \{' *' \}; \} R \mid \epsilon$$E \rightarrow F + E \{ print ('+');\} \mid F$$F \right...

Read the below mentioned grammar:$S \rightarrow X$$X \rightarrow YX \mid \epsilon$$Y \rightarrow aY \mid b$This grammar is NOT:$LALR$$LR (0)$$LR(1)$None of the above

In the construction of $LL(1)$ parsing table for the following grammar $M[S,( ] \& M [W, \$]$ are respectively$S \rightarrow XY$$X \rightarrow (S) \mid \text{ int } W$$Y\...

The grammar which has no epsilon transition or two adjacent nonterminals in the right side of any production is ___________.LL(1) grammarUnambiguous grammarOperator gramm...

___________ parsers build parse trees starting from the root node and work down to the leaves.LRLLSLRLALR

The number of proper prefixes for a string of length $n$ are ___________.$n+1$$n(n+1)/2$$n-1$$(n-1)/2$

Consider the following grammars:$Z \rightarrow TZ'$$Z' \rightarrow ^* TZ' \mid \epsilon$$T \rightarrow YT'$$T ' \rightarrow ^*YT ' \mid \epsilon$$Y \rightarrow (Z) \mi...

__________ is the most powerful parsing method.LL(1)LALRSLRCanonical LR

A top-down parser generates ________________.right-most derivationright-most derivation in reverseleft-most derivationleft-most derivation in reverse

Consider the following two parse trees for the expression: $6 - 4 - 3$ list list / | \ ...

The default type of conflict resolution rule for the Yacc parser generator is _________________. in favor of shift in favor of reduce either shift or reduce depen...

Match the following:$$\begin{array}{|l|l|l|l|} \hline a. & \text{Canonical Parser} & 1. & \text{No adjacent nonterminals} \\ \hline b. & \text{SLR(1) Parser} & 2. & \text...