| Task Name | Short Description | Description | Code | Tests |
|---|---|---|---|---|
| Task 1 Regular Expressions to Non-Deterministic Finite Automata | Implementing Thompson's construction algorithm in Java to convert a regular expression to an equivalent NFA |
Link | Java | Link |
| --- | --- | --- | --- | --- |
| Task 2 Non-Deterministic Finite Automata to Deterministic Finite Automata | Implementing the classical algorithm for constructing a deterministic finite automaton (DFA) equivalent to a given non-deterministic finite automaton (NFA). |
Link | Java | Link |
| --- | --- | --- | --- | --- |
| Task 3 Fallback Deterministic Finite Automata | Implementing a fallback deterministic finite automaton with actions (FDFA) abstract data type |
Link | Java | Link |
| --- | --- | --- | --- | --- |
| Task 4 Context-Free Grammars Epsilon & Unit Rules Elimination | Implementing the algorithms for eliminating epsilon and unit rules from a given context-free grammar (CFG) |
Link | Java | Link |
| --- | --- | --- | --- | --- |
| Task 5 Context-Free Grammars Left-Recursion Elimination | Implementing the context-free grammar (CFG) left-recursion elimination algorithm introduced in Lecture 3 of CSEN1003 |
Link | Java | Link |
| --- | --- | --- | --- | --- |
| Task 6 Context-Free Grammars First and Follow | Implementing the algorithms computing the functions First and Follow, introduced in Lecture 4 of CSEN1003 |
Link | Java | Link |
| --- | --- | --- | --- | --- |
| Task 7 LL(1) Parsing | Implementing an LL(1) parser using pushdown automata (PDA) and predictive parsing tables |
Link | Java | Link |
| --- | --- | --- | --- | --- |
| Task 8 ANTLR Lexical Analysis | Implementing a lexical analyzer using ANTLR |
Link | Antlr | Link |
| --- | --- | --- | --- | --- |
| Task 9 ANTLR Parsing I | Implementing an SDD using ANTLR |
Link | Antlr | Link |