Introduction - If you have any usage issues, please Google them yourself
Finite state machine realize It is an example of a bottom-up parser, using an algorithm I came up with. My bottom-up parser was completely hand-written, without any code generation. It s algoritm is centered around a finite-state machine code as a tree structure with several nodes and edges. The grammar is generated at runtime.INCLUDES PROJECTS for VC 6.0 and VC. NET FOR EASY COMPILATION.
Packet : 15883878a_bottom-u154180292003.zip filelist
@PSC_ReadMe_5703_3.txt
VC .NET/CodeObject.cpp
VC .NET/CodeObject.h
VC .NET/Grammar.cpp
VC .NET/Grammar.h
VC .NET/Input.txt
VC .NET/Output.txt
VC .NET/Reader.cpp
VC .NET/Reader.ncb
VC .NET/Reader.sln
VC .NET/Reader.suo
VC .NET/Reader.vcproj
VC .NET/ReadMe.txt
VC .NET/stdafx.cpp
VC .NET/stdafx.h
VC .NET/TokenMaker.cpp
VC .NET/TokenMaker.h
VC 6.0/CodeObject.cpp
VC 6.0/CodeObject.h
VC 6.0/Grammar.cpp
VC 6.0/Grammar.h
VC 6.0/Input.txt
VC 6.0/Output.txt
VC 6.0/Reader.cpp
VC 6.0/Reader.dsp
VC 6.0/Reader.dsw
VC 6.0/Reader.ncb
VC 6.0/Reader.opt
VC 6.0/Reader.plg
VC 6.0/stdafx.cpp
VC 6.0/stdafx.h
VC 6.0/TokenMaker.cpp
VC 6.0/TokenMaker.h