My 2018-2019 Spring Term BLM320E Formal Languages and Automata Theory Course Works

Term Project

• Regular Expressions

Class Works

• CW1 : Deterministic Finite Automata

• CW2 : NFA, DFA and RegExp

• CW3 : Regular Expressions

• CW4 : Context-free Grammar

• CW5 : Recursive Descent Parser

• CW6 : Push Down Automata

• CW7 : MicroJ3

• CW8 : Proposal Screenshot of Term Project

• CW9 : First Appearance of Term Project

• CW10 : Graph Algorithms

Home Works

• HW1 : RegExp for Strings and Arrays

• HW2 : Parsing of Math Operations

• HW3 : MicroJ1 Modifying

• HW4 : Demo Version of Term Project