Re: REQ: switch optimization info

J.M. Orost, "Case Statement Implementation in the Ada Compiler",
Perkin-Elmer Internal Memo, 8/29/85. Available via FAX only from
"joe@babel.ho.att.com".


@Article{bernstein:85a,
            author = "R. L. Bernstein",
            title = "Producing good code for the case statement",
            journal = "Software -- Practice \& Experience",
            volume = "15",
            number = "10",
            pages = "1021--1024",
            month = oct,
            year = "1985",
        }


@Article{Kannan:1994:SCC,
            author = "Sampath Kannan and Todd A. Proebsting",
            title = "Short Communication: Correction to {\em Producing Good
                                          Code for the Case Statement}",
            journal = "Software\emdash Practice and Experience",
            volume = "24",
            number = "2",
            pages = "233--233",
            month = feb,
            year = "1994",
            note = "Erratum for \cite{Bernstein:1985:PGC}.",
            acknowledgement = "Nelson H. F. Beebe, Center for Scientific
                                          Computing, Department of Mathematics, University of
                                          Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
                                          5254, FAX: +1 801 581 4148, e-mail:
                                          \path|beebe@math.utah.edu|",
            bibdate = "Wed Aug 24 15:30:39 1994",
}




@Article{Atkinson:1982:OTC,
            author = "L. V. Atkinson",
            title = "Optimizing two-state case statements in {PASCAL}",
            journal = "Software\emdash Practice and Experience",
            volume = "12",
            number = "6",
            pages = "571--581",
            month = jun,
            year = "1982",
            acknowledgement = "Nelson H. F. Beebe, Center for Scientific
                                          Computing, Department of Mathematics, University of
                                          Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
                                          5254, FAX: +1 801 581 4148, e-mail:
                                          \path|beebe@math.utah.edu|",
            bibdate = "Wed Aug 24 12:18:38 MDT 1994",
            keywords = "languages; performance",
            subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors,
                                          Code generation \\ D.3 Software, PROGRAMMING LANGUAGES,
                                          Language Classifications \\ D.2 Software, SOFTWARE
                                          ENGINEERING, Coding",
        }






@Article{hennessy:82a,
            author = "John L. Hennessy and N. Mendelsohn",
            title = "Compilation of the {Pascal} case statement",
            journal = "Software -- Practice \& Experience",
            volume = "12",
            pages = "879--882",
            year = "1982",
        }




@Article{Sale:spe:sep:1981,
            author = "Arthur Sale",
            title = "The Implementation of Case Statements in Pascal",
            journal = "Software -- Practice and Experience",
            volume = "11",
            number = "9",
            pages = "929--942",
            month = sep,
            year = "1981",
            checked = "19940428",
            keywords = "case statements, computer architecture",
            sjb = "Covers the obvious techniques of a sequence of ``ifs''
                                          and jump tables. Gives some metrics which can help
                                          chose which to implement for a given case statement.",
            abstract = "This paper examines the probable implementation of the
                                          case statement in Pascal, and analyses their
                                          consequences. A particular implementation for the
                                          Burroughs B6700/7700 series illustrates the necessary
                                          investigations. The techniques, although not new, are
                                          brought together to serve as a stimulus to improving
                                          the implementation of case-statements in other
                                          compilers for Pascal, and so provide ideas for
                                          implementors. The architectural limitations of even
                                          high-level computers in implementing the case statement
                                          are briefly discussed.",
        }




@TechReport{Fraser91,
            author = "Christopher W. Fraser and David R. Hanson",
            title = "A Retargetable Compiler for {ANSI} {C}",
            institution = "Department of Computer Science, Princeton University",
            number = "TR-303-91",
            pages = "20",
            month = feb,
            year = "1991",
            abstract = "Lcc is a new retargetable compiler for ANSI C.
                                          Versions for the VAX, Motorola 68020, SPARC, and MIPS
                                          are in production use at Princeton University and at
                                          AT\&T Bell Laboratories. With a few exceptions, little
                                          about lcc is unusual -- it integrates several
                                          well-engineered, existing techniques -- but it is
                                          smaller and faster than most other C compilers, and it
                                          generates code of comparable quality. Lcc's
                                          target-independent front end performs a few simple, but
                                          effective, optimizations that contribute to good code;
                                          examples include simulating register declarations and
                                      > partitioning switch statement cases into dense tables. <
                                          It also implements target-independent function tracing
                                          and expression-level profiling.",
}


                                                                regards,
                                                                joe


--
Full Name: Joseph M. Orost
EMail: joe@babel.ho.att.com, attmail!orost
Organization: AT&T Bell Laboratories: Software Migration & Tools
SurfaceMail: 943 Holmdel Rd.; Cruz Plaza; Holmdel, NJ 07733
Phone: +1 (908) 946-1115
Fax: +1 (908) 946-9146
WWW: http://paul.rutgers.edu/~orost
--

Return to the comp.compilers page.
Search the comp.compilers archives again.