CFGs / Parser Generator
Christian Wartena
wartena@ling.uni-potsdam.de
Thu, 8 Apr 1999 12:01:45 +0200 (MET DST)
Hello,
I have two questions:
1. Does anyone have some standard code for reading in context--free
grammars and corresponding type definitions for grammars, rules,
nonterminal symbols etc.?
2. Does anyone have a Clean implementation of Earley's algorithm?
Christian
\\\/// \\\///
/ _ _ \ / _ - \
(| (.)(.) |) (| (^)(^) |)
----------------.OOOo--()--oOOO.---.OOOo--()--oOOO.---------------------
| Christian Wartena Universitaet Potsdam |
| Institut fuer Linguistik |
| Tel: 0331 -- 977 2168 Postfach 60 15 53 |
| Fax: 0331 -- 977 2761 D - 14415 Potsdam |
-----------------.oooO--------------.oooO-------------------------------
( ) Oooo. ( ) Oooo.
\ ( ( ) \ ( ( )
\_) ) / \_) ) /
(_/ (_/