INT I Compiler Set 2
INT I Compiler Set 2
INT I Compiler Set 2
: ___________________
UNIVERSITY
Karunya Institute of Technology & Sciences
(Declared under section-3 of the UGC Act, 1956)
12. Construct a minimum state DFA directly for the regular expression m*n(m|nm*) by constructing
the syntax tree and finding firstpos(), lastpos() and followpos().
13. Construct a predictive parser for the following grammar and check whether the input not (true or
false) is parsed without errors.
bexpr ->bexprorbterm | bterm
bterm ->btermand bfactor | bfactor
bfactor ->not bfactor| (bexpr) | true | false