|syntax errors firstname.lastname@example.org (1995-02-20)|
|Re: syntax errors email@example.com (1995-02-22)|
|Re: syntax errors firstname.lastname@example.org (1995-02-23)|
|Re: syntax errors email@example.com (1995-02-27)|
|Re: syntax errors firstname.lastname@example.org (1995-02-28)|
|From:||email@example.com (Gordon V. Cormack)|
|Keywords:||errors, design, bibliography, comment|
|Organization:||University of Waterloo|
|Date:||Wed, 22 Feb 1995 13:27:38 GMT|
>Hello. Could anyone point me to work done on locating (and presenting)
>syntax errors? ...
Richter, "Noncorrecting syntax error recovery," TOPLAS 7:3 (1986)
Cormack, "An LR substring parser for noncorrecting syntax error recovery,"
SIGPLAN Notices 24:7 (PLDI conference), (1989).
Rekers, "Substring parsing for arbitrary context-free grammars,"
SIGPLAN Not. 26:5 (1991).
Bates & Lavie, "Recognizing substrings of LR(k) languages in linear time,"
TOPLAS 16:3 (1994)
Grune & Jacobs, "Parsing Techniques," Ellis Horwood (1990).
It appears to me that the general method outlined by Richter and expanded
by yours truly might be appropriate. Rekers uses Tomita's parser for
substrings, so that might be dear to your natural-language heart. I don't
see any reason why you couldn't use Earley's algorithm either. I've never
heard of a chart parser, but if it recognizes substrings I'd think it would
do the trick. [I bet there are lots of compilers types who have never
heard of a chart parser - please educate us.]
Gordon V. Cormack CS Dept, University of Waterloo, Canada N2L 3G1
[There's a nice description of chart parsing in message 87-05-010. They're
a kind of parallel parser designed to minimize redundant parsing work. -John]
Return to the
Search the comp.compilers archives again.