Scribd
Upload
19 views1 page

Automata Theory and Compiler Design-Assignment Questions

Assignment

Uploaded by

sankarayaswitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views1 page

Automata Theory and Compiler Design-Assignment Questions

Assignment

Uploaded by

sankarayaswitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Automata Theory and Compiler Design

Assignment Questions-I
1. Construct DFA equivalent to the following NFA. Show the acceptance of the string 00011 on
both the Fas. Assume that q0 is the start state and q3 is final state?

0 1
q0 {q0,q1} {q0}
q1 - {q2}
q2 - {q3}
q3 - -

2. Minimize the finite automaton given below and show both the given and the reduced one are
equivalent?

3. a) How to construct FA from the given Regular Expression?


b) Construct Finite Automaton to accept the Regular Expression?
(0 + 1) *(00+11) (0 + 1) *.

Assignment Questions -II


1. a) Differentiate Leftmost Derivation and Rightmost Derivation with an example?
b) For the string ‘aaabbabababb’, Give the Leftmost derivation, rightmost derivation and Parse
tree for the given grammar. Verify the given grammar is ambiguous or not?
S→ bA/ aB
A→ bAA/aS/a
B→ aBB/bS/b

2. a) Give the CFG for “The set of all strings of balanced parenthesis”?
b) Explain minimization of CFG with the following example?
S → aA | aBB
A → aAA | є
B → bB | bbC
C→B
3. Convert the following into GNF?
S→ AB
A→ BS/b
B→SA/a

You might also like