The semantic and syntactic manipulation of vacancies in associative binary trees

Execution of sub-processes within a program segment are subject to a partial ordering. In certain cases (such as expressions and assignment statements) this ordering reduces to a tree which, according to the characteristics of the operators present, may be manipulated to influence the extent to whic...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Int. J. Comput. Math.; (United States) 1983-01, Vol.13 (3-4), p.189-208
Hauptverfasser:	Abdollahzadeh, F., Cooke, D. J., Evans, D. J.
Format:	Artikel
Sprache:	eng
Schlagworte:	5.23 5.24 990200 - Mathematics & Computers Applied sciences ARRAY PROCESSORS balanced tree Binary tree Computer science control theory systems Exact sciences and technology GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE insertion Language theory and syntactical analysis MACHINE TRANSLATIONS MATHEMATICS PARALLEL PROCESSING PROGRAMMING Theoretical computing tree height vacancy
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!