Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Circular Reference Attributed Grammars - their Evaluation and Applications

Författare

Summary, in English

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.

Publiceringsår

2003

Språk

Engelska

Sidor

532-554

Publikation/Tidskrift/Serie

ENTCS - Electronic Notes in Computer Science

Volym

82

Issue

3

Dokumenttyp

Konferensbidrag

Förlag

Elsevier

Ämne

  • Computer Science

Nyckelord

  • fixed-point computations
  • Circular grammars
  • Attribute Grammars

Conference name

LDTA03 The third Workshop om Language Descriptions, Tools and Applications

Conference date

2003-04-06

Status

Published

Forskningsgrupp

  • LUCAS

ISBN/ISSN/Övrigt

  • ISSN: 1571-0661