Parsing

One or more correct

• AThe grammar is ambiguous
• BThe string $abb$ has two distinct derivations in this grammar
• CThe string $abab$ has only one rightmost derivation
• DThe language generated by the grammar is undecidable

One or more correct

• ALL(1) parser uses backtracking
• BFor a grammar to be LL(1), it must be left-recursive
• CFor a grammar to be LL(1), it must be left-factored
• DThe LL(1) parsers are more powerful than the SLR parsers

One or more correct

• A$S \to aSb \mid \epsilon$
• B$E \to E + E \mid E * E \mid id$
• C$S \to aS \mid Sa \mid \epsilon$
• D$S \to aS \mid \epsilon$

Single correct

• A2
• B3
• C4
• D5

One or more correct

• AFor a production $A \to \epsilon$, $\epsilon$ will be added to $First(A)$.
• BIf there is any input right end marker, it will be added to $First(S)$, where $S$ is the start symbol.
• CFor a production $A \to \epsilon$, $\epsilon$ will be added to $Follow(A)$.
• DIf there is any input right end marker, it will be added to $Follow(S)$, where $S$ is the start symbol.

Single correct

• A$G$ is neither LALR(1) nor SLR(1)
• B$G$ is CLR(1), not LALR(1)
• C$G$ is LALR(1), not SLR(1)
• D$G$ is LALR(1), also SLR(1)

One or more correct

• A$G_1$ is not $LL(1)$ and $G_2$ is $LL(1)$.
• B$G_1$ is $LL(1)$ and $G_2$ is not $LL(1)$.
• C$G_1$ and $G_2$ are not $LL(1)$.
• D$G_1$ and $G_2$ are ambiguous.

One or more correct

• AShift-reduce Parser
• BPredictive Parser
• CLL(1) Parser
• DLR Parser

Operator   Precedence   Associativity
   +       Highest      Left
   -       High         Right
   *       Medium       Right
   /       Low          Right

Numerical answer

Single correct

• A(1) $S \to Rf$ (2) $T \to \epsilon$ (3) $R \to cTR$
• B(1) $S \to fR$ (2) $T \to \epsilon$ (3) $R \to cTR$
• C(1) $S \to fR$ (2) $T \to cT$ (3) $R \to cR$
• D(1) $S \to Rf$ (2) $T \to cT$ (3) $R \to cR$

Single correct

• A(1) $S \to AaAb$ (2) $S \to BbBa$ (3) $A \to \epsilon$ (4) $B \to \epsilon$
• B(1) $S \to BbBa$ (2) $S \to AaAb$ (3) $A \to \epsilon$ (4) $B \to \epsilon$
• C(1) $S \to AaAb$ (2) $S \to BbBa$ (3) blank (4) blank
• D(1) $S \to BbBa$ (2) $S \to AaAb$ (3) blank (4) blank

Numerical answer

Single correct

• AThe $LALR(1)$ parser for a grammar $G$ cannot have reduce-reduce conflict if the $LR(1)$ parser for $G$ does not have reduce-reduce conflict.
• BSymbol table is accessed only during the lexical analysis phase.
• CData flow analysis is necessary for run-time memory management.
• D$LR(1)$ parsing is sufficient for deterministic context-free languages.

Answer key coming soon

Numerical answer

Answer key coming soon

Single correct

• A$S_1$ is true and $S_2$ is false
• B$S_1$ is false and $S_2$ is true
• C$S_1$ is true and $S_2$ is true
• D$S_1$ is false and $S_2$ is false

Answer key coming soon

Single correct

• A(1) $S \to Rf$ (2) $S \to Rf$ (3) $T \to \epsilon$ (4) $T \to \epsilon$
• B(1) blank (2) $S \to Rf$ (3) $T \to \epsilon$ (4) $T \to \epsilon$
• C(1) $S \to Rf$ (2) blank (3) blank (4) $T \to \epsilon$
• D(1) blank (2) $S \to Rf$ (3) blank (4) blank

Answer key coming soon

int main() {
    Integer x;
    return 0;
}

Single correct

• ALexical analyzer
• BSyntax analyzer
• CSemantic analyzer
• DMachine dependent optimizer

Answer key coming soon

Numerical answer

Answer key coming soon

Single correct

• AI only
• BII only
• CI and III only
• DIII only

Answer key coming soon

Numerical answer

Answer key coming soon