|Methods for NFA-directed parsing? email@example.com (Bob Foster) (2003-01-25)|
|From:||"Bob Foster" <firstname.lastname@example.org>|
|Date:||25 Jan 2003 01:11:35 -0500|
|Posted-Date:||25 Jan 2003 01:11:35 EST|
Can someone point to literature on algorithms for parsing using NFA
for regular or regular tree languages? Material available on the web
would be most helpful, though other sources are welcome, too.
To be clear, my interest is in using NFAs, not constructing them. In
introductory computer science, the standard approach seems to be
backtracking, with which I am already familiar. Obviously n-state
lookahead would be an option for some expressions. Some of the
techniques applied to context-free languages might be scaled back to
regular expressions. Etc.
In the best of worlds, in addition to papers on individual methods,
someone could recomment a "taxonomy" of interpretation techniques, as
was done by Watson for constructing NFAs.
B. W. Watson, A taxonomy of finite automata construction algorithms.
Computing Science Note 93/43, Eindhoven University of Technology, The
Return to the
Search the comp.compilers archives again.