Re: "Near Miss" error handling?

Jon Beniston <jbeniston@siroyan.com>
28 Mar 2001 08:46:12 -0500

          From comp.compilers
Related articles
"Near Miss" error handling? gwyn@thislove.dyndns.org (2001-03-27)
Re: "Near Miss" error handling? jbeniston@siroyan.com (Jon Beniston) (2001-03-28)
Re: "Near Miss" error handling? eeide@cs.utah.edu (Eric Eide) (2001-03-31)
Re: "Near Miss" error handling? eballen1@qwest.net (Bruce Ediger) (2001-03-31)
Re: "Near Miss" error handling? guerby@acm.org (Laurent Guerby) (2001-03-31)
Re: "Near Miss" error handling? samiam@cisco.com (Scott Moore) (2001-03-31)
Re: "Near Miss" error handling? Martin.Ward@durham.ac.uk (2001-03-31)
Re: "Near Miss" error handling? ian.trudel@tr.cgocable.ca (Ian Trudel) (2001-03-31)
[8 later articles]
| List of all articles for this month |
From: Jon Beniston <jbeniston@siroyan.com>
Newsgroups: comp.compilers
Date: 28 Mar 2001 08:46:12 -0500
Organization: Siroyan, Ltd
References: 01-03-135
Keywords: parse, errors
Posted-Date: 28 Mar 2001 08:46:11 EST

Gwyn Judd wrote:
> I'm writing (modifying actually) a compiler for my final undergraduate
> project and I've come across a feature I've never seen in a production
> compiler. basically when the compiler comes across an identifier it
> hasn't seen before, it will go through the list of known identifiers
> and try to determine which is the closest so it can then make a
> hopefully helpful suggestion on how to correct the error. ...


I'd imagine that the algorithms used by spell checkers (meaning those
that offer suggestions on how to correct misspelled words) are quite
similar. I'm pretty sure that the Jikes Java compiler does this as
well. (It's open source, so you're free to see how it does it)


Cheers,
JonB




Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.