FLCT

FLCT – lab 3

Lab3 – assigned in week 7, due in week 9

Context-free grammars

Starting from the (E)BNF syntax rules from Lab 1, construct the context free grammar corresponding to your mini-language to be used in parsing.…

FLCT

FLCT – lab 2

Lab2 – assigned in week 5, due in week 7

Regular grammars and finite automata

Write a program that:
1. reads a grammar (from the keyboard and from a file);
2. displays the elements of a grammar, using a menu: the set of non-terminals, the set of terminals, the set of productions, the productions of a given non-terminal symbol;
3.…