Showing papers by "R. Nigel Horspool published in 2000"
25 Mar 2000
TL;DR: A new, simple method for converting to SSA form is presented, which produces correct solutions for nonreducible control-flow graphs, and produces minimal solutions for reducible ones.
Abstract: The static single-assignment (SSA) form of a program provides data flow information in a form which makes some compiler optimizations easy to perform. In this paper we present a new, simple method for convertingto SSA form, which produces correct solutions for nonreducible control-flow graphs, and produces minimal solutions for reducible ones. Our timing results show that, despite its simplicity, our algorithm is competitive with more established techniques.
52 citations
Proceedings Article•
23 Feb 2000
TL;DR: It is shown how a form of least cost parsing used with a very general and ambiguous grammar may be used to select an appropriate structure for a LaTeX equation.
Abstract: Mathematical equations in LaTeX are composed with tags that express formatting as opposed to structure For conversion from LaTeX to other word-processing systems, the structure of each equation must be inferred We show how a form of least cost parsing used with a very general and ambiguous grammar may be used to select an appropriate structure for a LaTeX equation MathML provides another application for the same technology; it has two alternative tagging schemes - presentation tags to specify formatting and content tags to specify structure While conversion from content tagging to presentation tagging is straightforward, the converse is not Our implementation of least cost parsing is based on Earley’s algorithm
2 citations