Abstract
AbstractFollow set error recovery is a popular technique, implemented as part of a recursive descent parser, for recovering from syntax errors by editing the input string at the point of error detection. A formal description shows that follow set error recovery is, in actual fact, a family of similar techniques differing according to how follow set is defined. A general algorithm for this family of schemes is offered. Standard accounts mention and make use of non‐systematic, almost ad hoc, additions which improve the performance of the technique. It is shown that some of these additions can be systematized using error productions. Criteria for assessment of the technique are offered. Using these criteria and a database of over 100 example programs three different follow set schemes are assessed with respect to each other.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
