Student Work

 

Parsing using recursive adaptive grammars Public

Downloadable Content

open in viewer

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.

  • This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
Creator
Publisher
Identifier
  • 02D497M
Advisor
Year
  • 2002
Date created
  • 2002-01-01
Resource type
Major
Rights statement
License

Relationships

In Collection:

Items

Permanent link to this page: https://digital.wpi.edu/show/m613n1728