Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Circular Reference Attributed Grammars - their Evaluation and Applications

Publiceringsår: 2003
Språk: Engelska
Sidor: 532-554
Publikation/Tidskrift/Serie: ENTCS - Electronic Notes in Computer Science
Volym: 82
Nummer: 3
Dokumenttyp: Konferensbidrag
Förlag: Elsevier


This paper presents a combination of Reference Attributed Grammars (RAGs) and Circular Attribute Grammars (CAGs). While RAGs allow the direct and easy specification of non-locally dependent information, CAGs allow iterative fixed-point computations to be expressed directly using recursive (circular) equations. We demonstrate how the combined formalism, Circular Reference Attributed Grammars (CRAGs), can take advantage of both these strengths, making it possible to express solutions to many problems in an easy way. We exemplify with the specification and computation of the nullable, first, and follow sets used in parser construction, a problem which is highly recursive and normally programmed by hand using an iterative algorithm. We also present a general demand-driven evaluation algorithm for CRAGs and some optimizations of it. The approach has been implemented and experimental results include computations on a series of grammars including Java 1.2. We also revisit some of the classical examples of CAGs and show how their solutions are facilitated by CRAGs.


  • Computer Science
  • fixed-point computations
  • Circular grammars
  • Attribute Grammars


LDTA03 The third Workshop om Language Descriptions, Tools and Applications
  • LUCAS-lup-obsolete
  • ISSN: 1571-0661

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen