Entry Hailperin:1997:IFP from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | 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{Hailperin:1997:IFP,
  author =       "Max Hailperin",
  title =        "Introducing fixed-point iteration early in a compiler
                 course",
  journal =      j-SIGCSE,
  volume =       "29",
  number =       "1",
  pages =        "258--261",
  month =        mar,
  year =         "1997",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/268085.268182",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:38 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "When teaching a course in compiler design, it is
                 conventional to introduce the iterative calculation of
                 least fixed points quite late in the course, in the
                 guise of iterative data-flow analysis. In this paper I
                 point out that the same mathematical and algorithmic
                 ideas can be introduced much earlier, in the parsing
                 portion of the course, as an explanation of the
                 standard algorithm for computing the First sets of a
                 context-free grammar. Doing so not only renders these
                 techniques more familiar when they re-appear in
                 data-flow analysis, it also provides a more sound
                 foundation for the First algorithm than is typically
                 offered. Moreover, these techniques deserve increased
                 curricular prominence because they naturally lead to
                 proofs of correctness for general non-deterministic
                 algorithms that subsume multiple deterministic
                 algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries