|
>> Of course, mine was a bit more specialized in nature, and while it now does >> what it does quite well (ever write a >> recursive descent parser in ILE RPG? It can be done, but it's only useful in >> very specialized situations), it wouldn't >> be very useful anywhere else. I do State Transition Engines(Left to Right Table Driven Parser) which is a form of parsing. I even have a figured out how to write a generic version. I store my tables in User Spaces and the program reads user spaces and does the parsing and does callback to implement actions. I use state transition for my make tool, fedex parsing, string parsing, message label processing. Very powerful tool but nothing like what I just read about the descent parser, nothing that complex. How do you implement?
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2025 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.