This is how to convert regex (REGular EXpression) to DFA by creating and using syntax tree in Java language. This project is a part of a bigger project we'd done for Compiler Course to create a simple ...

Node Class: defining a node of tree. BinaryTree Class: define a set of nodes and organize them in the binary tree. BinarySearchTree Class: define a set of nodes and organize them in the binary search ...