What are the difference between linear and non-linear data structure?

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.)

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;

}

Explain left factoring with suitable example.

Draw the syntax tree and DAG from the following expression.

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

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

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.

Explain different stages of compiler with a suitable example. What is token, Patterns and Lexeme?

What is Basic Block? List out the basic blocks and draw the flow graph for the following code:

What do you mean by a Handle? Give example. When a grammar is called ambiguous? Is there any technique to remove ambiguity? Explain with an example. What is the reduce-reduce conflict in LR parser? What are various data structures used for symbol table construction?