/compilers_lab_2

Task8: Implement of an ANTLR lexical analyzer for a fallback DFA. (The fallback DFA is encoded as in the Task 4 description document.). Task9: Using ANTLR to implement the SDD appearing below for a CFG that generates the language a *c *b * . S −→ ACB A −→ aA1 A −→ ε B −→ bB1 B −→ ε C −→ cC1 C −→ ε S.check = equals(A.n, B.n) ∗ equals(A.n, C.n) A.n = A1.n + 1 A.n = 0 B.n = B1.n + 1 B.n = 0 C.n = C1.n + 1 C.n = 0

Primary LanguageJava

This repository is not active