CD Quiz Batch B2 1a and 1 b programs

Yacc implements which parser?

• LALR

• CLR

• SLR

• LR(0)

Which part produces the target code from the intermediate representation of source code?

• Lexical Analysis

• Synthesis

• Analysis

• None

Which Phase of the compiler identifies the error(if present) in the following C code:

a+b=c;

• Lexical analysis

• Syntax analysis

• Semantic analysis

• There are no errors in the code

Calculate the FIRST set for the following grammar

S → aBDh | C

B → cC

C → bC / ∈

D → EF

E → g / ∈

F → f

• First(S) = { a,b,∈} First(B) = { c } First(C) = { b , ∈ } First(D) = { g , f } First(E) = { g , ∈ } First(F) = { f}

• First(S) = { a,b} First(B) = { c } First(C) = { b , ∈ } First(D) = { g , f, ∈} First(E) = { g , ∈ } First(F) = { f}

• First(S) = { a,b} First(B) = { c } First(C) = { b , ∈ } First(D) = { g , f } First(E) = { g} First(F) = { f }

• None of the above

Compute Follow set for the following grammar for constructing the predictive parsing table:

S → AB

A → aB / AdC

B → b | ∈

C → g

• Fo(S) = { $ }

  Fo(A) = { $,d,b}

  Fo(B) = { $,d,b}

  Fo(C) = { $,d,b }

• Fo(S) = { $ }

  Fo(A) = { d,b,∈}

  Fo(B) = { b,d,b}

  Fo(C) = { d,b,∈ }

• Fo(S) = { $ }

  Fo(A) = { ∈,d,b}

  Fo(B) = { $,d,b}

  Fo(C) = { $,d,b }

• First(S) ={ a, b} First(A) = { a } First(A’) = { d , ∈ } First(B) = { b ,∈} First(C) = { g }

What is the purpose of a predictive parsing table in compiler design?

• To store the parsing rules for each non-terminal symbol

• To generate the intermediate code from the source code

• To optimize the lexical analysis phase

• To execute the target code directly

Explain the role of a syntax analyzer in the compilation process.

• To convert the source code into tokens

• To check the syntax of the source code based on the grammar rules

• To generate the final executable code

• To perform optimization on the intermediate code

What is the significance of the LR(0) parser in compiler construction?

• It is used to perform lexical analysis

• It is a type of shift-reduce parser

• It is capable of handling left-recursive grammars

• It is used to generate the abstract syntax tree