|
|
LALL is a top-down implementation of a parser generator that takes as input, grammars similar to the YACC *.y files. It has the capability to factor an LR(1) grammar to be close to LL(1) (without actions). The parser it generates can handle LL(1) grammars, and has lookaheads (thus LALL(1)). Although it is like a predictive parser, it generates a finite state machine. An option exists to integrate a command line debugger with the generated parsers, to single step, trace and view what states are traversed in the parse. This is an excellent tool to become familiar with parsing techniques, and compilers.
LALL generates a program that is either compiled or interpreted. The output is in source code form, with the parsing algorithm included. For now it generates output for C. The evaluation version is limited in the number of states, transitions, rules, etc, and will only support one language. One advantage of using this tool as opposed to the traditional YACC (Bison, etc), is that it may be used as a co-routine for interactive applications. For example, a video game may have a FSM integrated intoit to allow better control of the current context. Many other applications are possible: wherever a FSM could be useful.
|
|
LALL Parser