We present in easily reproducible terms, a simple transforrnatiomm for offline-parsable grammars which results in a provably terminatiing parsing program directly top-down interpretable in Prolog. The transformation consists in two steps: (1) removal of empty-productions, followed hy: ( 2 ) left-recursionr elimination. It is related both to left-corner parsing (where the grammar is compiled rather thani interpreted through a parsing program, and with the advantage of guaranteed termination in tine presence of empty productions) and to the Generalized Greibach Normal Form for DCGs (with the advantage of implementation simplicity ).
You may choose which kind of cookies you allow when visiting this website. Click on "Save cookie settings" to apply your choice.
FunctionalThis website uses functional cookies which are required for the search function to work and to apply for jobs and internships.
AnalyticalOur website uses analytical cookies to make it possible to analyse our website and optimize its usability.
Social mediaOur website places social media cookies to show YouTube and Vimeo videos. Cookies placed by these sites may track your personal data.
This content is currently blocked. To view the content please either 'Accept social media cookies' or 'Accept all cookies'.
For more information on cookies see our privacy notice.