CMU Artificial Intelligence Repository
Tom: C implementation of the Tomita parsing algorithm
areas/nlp/parsing/tom/
This directory contains Tom, a C implementation of the Tomita
parsing algorithm.
The software constructs LR(0) parsing tables for arbitrary context
free grammars, which you specify. It then processes any input you
give it and displays the resulting parse forest and optionally the
parse stack as well. The parse tables are also shown, if you
requests it, since reference is made to them in the parse stack.
One difference between this and Tomita's original algorithm is this
algorithm has been modified into a dynamic programming algorithm,
capable of handling all CFG's including cyclic grammars.
Origin:
csd4.csd.uwm.edu:/pub/compilers/tomita/
Version: 23-MAY-93
Requires: ANSI C
Copying: No licensing or copyright restrictions.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Author(s): Mark Hopkins
Mark Hopkins Consulting
2619 North Oakland Avenue, Suite 204
Milwaukee, Wisconsin 53211-3523
Tel: 414-332-8857
Keywords:
Authors!Hopkins, C!Code, LR(0) Parser Generator, NLP,
Parsing, Tom, Tomita Parser
References:
Last Web update on Mon Feb 13 10:27:03 1995
AI.Repository@cs.cmu.edu