|Parse Demo Applet Available email@example.com (Zerksis Umrigar) (1997-06-30)|
|From:||Zerksis Umrigar <firstname.lastname@example.org>|
|Date:||30 Jun 1997 23:10:44 -0400|
parsdemo is a interactive java applet used to demonstrate the
operation of the following parsing algorithms:
+ Recursive-descent parsing.
+ Table-driven LL(1) parsing.
+ Shift-reduce parsing.
Besides showing a parse tree or forest as it is being constructed,
the applet shows the current line in the program (for the
recursive-descent parser) or state in the parse table (for the LL(1)
and shift-reduce parsers). It also displays a trace of the stack
contents followed by the remaining input.
The demo comes with hand-written parsers for a simple language
involving assignments and arithmetic expressions. It should be
relatively easy to add parsers for other languages, as each
language/parser combination is described by two leaf classes: a class
describing the grammar and a class describing the parser or parse
table (the applet does not construct parsers automatically from the
It is also possible to run the demo as a stand-alone java program by typing:
java zdu.parsdemo.ParsDemo [ALGORITHM]
where ALGORITHM is one of `LL1', `SR', or `Rec' (default).
parsdemo is available for viewing or download at:
Unfortunately, as our computer center tends to abruptly turn routers
on and off, these sites are not terribly reliable (especially on weekends).
Return to the
Search the comp.compilers archives again.