Assignment for End Sem Exam
1. Write a program for inputting an NFA and identifying if
a string is valid or not by simulating NFA using onfly ebs
closure subset construction algorithm
2. Write a program to convert regular expression to DFA
using direct conversion by calculating First and Follow
and simulate it to check if an input string is valid or not
3. Construct a top down parser from the grammar and
parse the string to check if it is valid or not and display
the intermediate results (in form of intermediate
derivation or parsing tree)
OR
Perform following operations for designing a bottom up
parser
i.Design LR(0) automaton
ii.
Construct a parsing table using LR(0)
automaton
iii.
Check if a string is valid or not using the
parsing table and display the intermediate
results