Premium
Interpretation control using a linear tree representation
Author(s) -
Lichtman Zavdi L.
Publication year - 1977
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.4380070218
Subject(s) - representation (politics) , interpretation (philosophy) , computer science , tree (set theory) , context (archaeology) , interpreter , simple (philosophy) , tree structure , control (management) , theoretical computer science , artificial intelligence , mathematics , data structure , programming language , paleontology , philosophy , epistemology , politics , political science , law , biology , mathematical analysis
A linear tree structure is considered for the internal representation of programs executed by interpreters. This representation is appropriate when one wishes to have an internal representation preserving the high level structures of the source language. The linear tree structure facilitates a simple mechanism for interpretation control in the context of high level control structures.