Entry Boyland:1996:CAG from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Boyland:1996:CAG,
  author =       "John Tang Boyland",
  title =        "Conditional attribute grammars",
  journal =      j-TOPLAS,
  volume =       "18",
  number =       "1",
  pages =        "73--108",
  month =        jan,
  year =         "1996",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Tue Aug 13 11:46:35 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/225544.html",
  abstract =     "Attribute grammars are a useful formalism for the
                 specification of computations on structured terms. The
                 classical definition of attribute grammars, however,
                 has no way of treating conditionals nonstrictly.
                 Consequently, the natural way of expressing many
                 otherwise well-behaved computations involves a
                 circularity. This article presents {\em conditional
                 attribute grammars}, and extension of attribute
                 grammars that enables more precise analysis of
                 conditionals. In conditional attribute grammars,
                 attribute equations may have guards. Equations are
                 active only when their guards are satisfied. The
                 standard attribute grammar evaluation classes are
                 definable for conditional attribute grammars, and the
                 corresponding evaluation techniques can be easily
                 adapted. However, determining membership in standard
                 evaluation classes such as 1-SWEEP, OAG, and SNC is
                 NP-hard.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "languages; theory",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Translator writing systems and compiler
                 generators. {\bf F.4.2}: Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and
                 Other Rewriting Systems. {\bf D.3.4}: Software,
                 PROGRAMMING LANGUAGES, Processors, Code generation.
                 {\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Compilers.",
}

Related entries