L. Atkinson. Optimizing two-state case statements in Pascal. Software--- Practice and Experience, 12:571--581, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Multiway Radix Search Trees - Erlingsson, Krishnamoorthy, Raman (1996) (1 citation) (Correct)
....be thought of as generating a Multiway Radix Search Tree (MRST) on the case labels. Although the MRST method is appropriate for most searches where a static search tree can be generated, this paper discusses only its application to switch statements. There has been considerable work in the past ([2], 3] 5] 6] and [10] on the Pascal case statement and code generation. The generation of code for switch statements is discussed in [4] and [11] A scheme similar to MRST, but restricted to binary radix search trees, appears in [9] Preprint submitted to Elsevier Preprint 8 August 1997 ....
L. Atkinson. Optimizing two-state case statements in Pascal. Software--- Practice and Experience, 12:571--581, 1982.
Lucid and Efficient Case Analysis - Erlingsson, Krishnamoorthy, Raman (Correct)
....the case labels, and is referred to as the MRST method throughout this paper. Although the MRST method is appropriate for most searches where a static search tree can be generated, only its application to switch statements is considered here. There has been considerable work in the past ( 8] 5] [2], 3] and [6] regarding the Pascal case statement and code generation. Generating code for switch statements is discussed in [4] and [9] A scheme similar to MRST, but restricted to binary radix search trees, can be found in [7] We begin, in section 2, by describing the MRST method of code ....
L. Atkinson, "Optimizing Two-state Case Statements in Pascal," Software---Practice and Experience, Vol. 12, 1982, pp. 571--581.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC