MindStudy - MindStudy

Question:

Published on: 16 September, 2024

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

Answer:

Subjects

Software Engineering Database Management System C Programming and Practices Mobile computing Data Structures & Algorithm Compiler Design

Trending

Consider the grammar:

S → aSbS | bSaS | 𝜖

Show that this grammar is ambiguous by constructing two different left most derivations for the sentence abab.

Construct the corresponding right most derivations for abab.

Construct the corresponding parse tree for abab.

What language does this grammar generate?

16 September, 2024

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;

}

16 September, 2024

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?

16 September, 2024

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.

16 September, 2024

For the input expression (4*7+1)*2, construct an annotated parse tree.

16 September, 2024