Scribd
Upload
4 views

Assignment Unit III

This document is an assignment sheet for the Theory of Automation and Formal Language course at IIMT Engineering College for the 2024-25 session. It includes tasks such as eliminating left recursion from given grammars, describing the Chomsky hierarchy, determining the ambiguity of a context-free grammar, defining Greibach normal form, and converting a CFG to its equivalent GNF. The assignment is due on June 6, 2025, and was submitted on June 10, 2014.

Uploaded by

SNEHA CHAUDHARY
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
4 views

Assignment Unit III

This document is an assignment sheet for the Theory of Automation and Formal Language course at IIMT Engineering College for the 2024-25 session. It includes tasks such as eliminating left recursion from given grammars, describing the Chomsky hierarchy, determining the ambiguity of a context-free grammar, defining Greibach normal form, and converting a CFG to its equivalent GNF. The assignment is due on June 6, 2025, and was submitted on June 10, 2014.

Uploaded by

SNEHA CHAUDHARY
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

IIMT ENGINEERING COLLEGE

Department of Computer Science and Engineering


COURSE FILE
Theory of Automation and Formal Language - BCS-402

Session: 2024-25 Semester: Even

Due Date: 06/06/2025 Submission Date: 10/06/2014

Assignment Sheet-III
This assignment corresponds to Unit No. III and CO-3

1. Write the procedure and eliminate left recursion from the following Grammar.
a. E → E + T / T
b. T → T*F / F
c. F → (E)/id
2. Describe Chomsky hierarchy.
3. A context free grammar G is given by the following productions:
E→E+E|E-E|E∗E|E^E|N
N→0|1|2|3|4|5|6|7|8|9
Determine whether the grammar G is ambiguous or not. If ambiguous then construct
an unambiguous grammar equivalent to G.
4. Define Greibach normal form (GNF) for a CFG.
Convert the following CFG to its equivalent GNF:
S → AA | a, A → SS | b.

5. Find the regular expression of Given FA using Arden’s theorem.

Signature of Faculty

Page 85 of 98

You might also like