×
The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.
Dennis Lovelady wrote:
Thanks for the help on this, folks ('specially Simon and Charles). Looks
like the root problem was a partial- rather than full-read of the
documentation.
I've enjoyed following this thread, and seeing CL in BNF (although I've
always despised the convention of "::=" in place of a right-arrow, and
used an actual right-arrow in all my own BNF productions).
And I've also enjoyed making my own small (and borderline sarcastic)
contributions, and seeing Simon, Charles, and others elaborate upon them
and refer to resources I never knew existed. As much as I believe all
programmers should have a semester of compiler construction, I never
realized there were that many other like-minded people on this List.
Say what you want about YACC (and BISON, and so forth), but recursive
descent is well-suited to a hand-coded parser, and a hand-coded
recursive descent parser almost always works, no matter how weird the
language. And if the source language you're parsing is simple enough
(i.e., one without nested constructs), the parser can use recursive
descent techniques without actually being recursive.
--
JHHL
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact
[javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.
midrange.com
