problem 1:
describe how DFA is constructed directly from regular expression.
problem 2:
Illustrate Operator Precedence Parsing Concepts with suitable exs.
problem 3:
Elucidate Operator Precedence Relation from Associative specification.
problem 4:
Describe the specification of a simple type checker.
problem 5:
Discuss the ways of representing Intermediate Languages.
problem 6:
Illustrate the Dag Construction algorithm with an ex.
problem 7:
Discuss the organization of optimizing compiler with an ex.