Gennert, Michael A.
Recursive Adaptive Grammars (RAGs), a newly-developed Turing-powerful declarative grammar formalism, is particularly suitable for analyzing language properties and for providing formal specification of language semantics. In this project we developed, implemented, and compared two RAG-based parsing algorithms. Time-space complexity analysis of both algorithms was performed. The first algorithm imposed no restrictions on the grammar but was significantly less efficient. The second only supported left-to-right grammars with no left recursion but achieved a reasonable level of performance for practical use.
Worcester Polytechnic Institute
Major Qualifying Project
Access to this report is limited to members of the WPI community. Please contact a project advisor or their department to request access
Restricted-WPI community only