资 源 简 介
SimExp implements the following algorithms from parsing and compilation theory:
* Regular expression to nondeterministic finite-state machine conversion.
* Regular expression to deterministic finite-state machine conversion.
* Nondeterministic finite-state machine to deterministic finite-state machine conversion.
* Regular expression to context-free grammar in BNF form conversion.
* Context-free grammar to LL(1) and LR(k) parser conversion.
* Simplification of grammars.
* Compilation of boolean and arithmetical expressions into bytecode.
This project was implemented by the authors during the second year of their study in Moscow Institute of Physics and Technology (MIPT) for the course of Theory of Compilation led by K. Teimurazov.
Implemented in C# using .NET Framework 2.0.
User interface is in Russian. You may contact authors if this is a problem.
The code is a bit outdated and there are some critical bugs in UI that manifest themselfs on Windows Vis
