Compilation of the Pascal case statement
John LeRoy Hennessy, Noah Mendelsohn · Software Practice and Experience · 1982
Abstract Pascal case statements can be compiled using a variety of methods, including comparison trees and branch tables. The scheme discussed here combines the two techniques to allow comparison trees with entries that are branch tables. The use of a combination of the two techniques is shown to adapt well to certain instances of case statements. Extensions to the standard case statement also require such a scheme to obtain an efficient implementation.