Entry Madhavan:2000:EGG 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{Madhavan:2000:EGG,
  author =       "Maya Madhavan and Priti Shankar and Siddhartha Rai and
                 U. Ramakrishna",
  title =        "Extending {Graham-Glanville} techniques for optimal
                 code generation",
  journal =      j-TOPLAS,
  volume =       "22",
  number =       "6",
  pages =        "973--1001",
  year =         "2000",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Wed Jul 25 13:55:50 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/toplas/2000-22-6/p973-madhavan/p973-madhavan.pdf;
                 http://www.acm.org/pubs/citations/journals/toplas/2000-22-6/p973-madhavan/",
  abstract =     "We propose a new technique for constructing
                 code-generator generators, which combines the
                 advantages of the Graham-Glanville parsing technique
                 and the bottom-up tree parsing approach. Machine
                 descriptions are similar to Yacc specifications. The
                 construction effectively generates a pushdown automaton
                 as the matching device. This device is able to handle
                 ambiguous grammars, and can be used to generate locally
                 optimal code without the use of heuristics. Cost
                 computations are performed at preprocessing time. The
                 class of regular tree grammars augmented with costs
                 that can be handled by our system properly includes
                 those that can be handled by bottom-up systems based on
                 finite-state tree parsing automata. Parsing time is
                 linear in the size of the subject tree. We have tested
                 the system on specifications for some systems and
                 report table sizes.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  generalterms = "Algorithms; Languages",
  keywords =     "code-generator generator; optimal code generation;
                 tree pattern matching",
  subject =      "Software --- Programming Languages --- Processors
                 (D.3.4): {\bf Code generation}; Software ---
                 Programming Languages --- Processors (D.3.4): {\bf
                 Retargetable compilers}; Software --- Programming
                 Languages --- Processors (D.3.4): {\bf Translator
                 writing systems and compiler generators}",
}

Related entries