Compilation of the Pascal case statement | Zendy

Hennessy John L. | Zendy; Mendelsohn Noah | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Compilation of the Pascal case statement

Author(s) -

Hennessy John L.,

Mendelsohn Noah

Publication year - 1982

Publication title -

software: practice and experience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.437

H-Index - 70

eISSN - 1097-024X

pISSN - 0038-0644

DOI - 10.1002/spe.4380120907

Subject(s) - pascal (unit) , statement (logic) , computer science , scheme (mathematics) , programming language , variety (cybernetics) , algorithm , theoretical computer science , mathematics , artificial intelligence , linguistics , mathematical analysis , philosophy

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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research