Compiler Design

All Q&A

Consider the following grammar:

Prove the above grammar is LL (1). Draw the parsing table. Now check whether the string “ab” and “acbd” are the languages of the above grammar. (Derive each step with the help of a stack.)

27 July, 2024

S→aABb A→c|𝜖 B→d| 𝜖

Consider the following grammar:

E → E+T | T

T → T*F | F

F → (E) | id

Draw a SLR state transition diagram for the above grammar. Also draw the SLR table.

27 July, 2024

State transition diagram FOLLOW(E)

Generate the three address code for the following code segment.

main()

{

       int a=1, z=0;

       int b[10];

       while (a<=10)

             b[a]=2*a;

       z=b[a]+a;

}

27 July, 2024

Three address code for the above code segment: I0 func begin main

Explain left factoring with suitable example.

27 July, 2024

Left factoring is removing the common left factor that appears in two productions of the same non-terminal.

Draw the syntax tree and DAG from the following expression.

if x>0 then x=3*(y+1) else y=y+1

27 July, 2024

Syntax tree

Convert the Regular Expression into e-NFA and then corresponding DFA.

27 July, 2024

Regular expression

Compare quadruples, triples and indirect triples.

x= (a + b) * - c / d

Represent this expression in quadruples, triples and indirect triples forms. Generate the machine code for the following instruction:

V=a+(b*c)-d.

27 July, 2024

The three address code can be using following methods: Quadruple: the quadruple is a structure with at most 4 fields such as OP, arg1, arg2, and result.

Subjects

Data Structures & Algorithm Database Management System Software Engineering Computer Graphics and Multimedia Design and Analysis of Algorithm C Programming and Practices

Browse Streams

Computer Science & Engineering

Electrical Engineering

Electronics & Communication Engineering

Civil Engineering