Entry Park:1985:NAL 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{Park:1985:NAL,
  author =       "Joseph C. H. Park and K. M. Choe and C. H. Chang",
  title =        "A New Analysis of {LALR} Formalisms",
  journal =      j-TOPLAS,
  volume =       "7",
  number =       "1",
  pages =        "159--175",
  month =        jan,
  year =         "1985",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Wed Mar 6 12:00:21 1985",
  bibsource =    "Compiler/compiler.bib; Compiler/Compiler.Lins.bib;
                 Compiler/TOPLAS.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/2527.html",
  abstract =     "The traditional LALR analysis is reexamined using a
                 new operator and an associated graph. An improved
                 method that allows factoring out a crucial part of the
                 computation for defining states of LR(0) canonical
                 collection and for computing LALR(1) lookahead sets is
                 presented. This factorization leads to significantly
                 improved algorithms with respect to execution time as
                 well as storage requirements. Experimental results
                 including comparison with other known methods are
                 presented.",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; experimentation; LALR(1) lookahead sets;
                 LALR(k) grammar; languages; parser generating system;
                 performance; theory; verification",
  subject =      "{\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Grammars and Other Rewriting
                 Systems, Parsing. {\bf D.3.4}: Software, PROGRAMMING
                 LANGUAGES, Processors, Compilers. {\bf D.3.4}:
                 Software, PROGRAMMING LANGUAGES, Processors, Translator
                 writing systems and compiler generators. {\bf D.3.1}:
                 Software, PROGRAMMING LANGUAGES, Formal Definitions and
                 Theory, Syntax. {\bf F.4.2}: Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and
                 Other Rewriting Systems, Grammar types. {\bf D.3.4}:
                 Software, PROGRAMMING LANGUAGES, Processors, Parsing.",
}

Related entries