Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A PROGRAM EXECUTION MODEL BASED ON GENERATIVE DYNAMIC John Aycock
 

Summary: A PROGRAM EXECUTION MODEL BASED ON GENERATIVE DYNAMIC
GRAMMARS
John Aycock
Department of Computer Science
University of Calgary
Calgary, Alberta, Canada
email: aycock@cpsc.ucalgary.ca
ABSTRACT
The term "context-free grammar" invariably implies use of
a static, unchanging set of grammar rules. When this con-
straint is removed, dynamic grammars result. In the past,
use of dynamic grammars has been relegated to semantics
work. However, we show that by defining and interpret-
ing dynamic grammars appropriately, we can create a new
grammar-based program execution model. This model uni-
fies disparate areas such as compiler construction, oper-
ating systems, data compression, formal languages, inter-
process communication, and program representation. Ap-
plication areas include code compression in embedded sys-
tems and the implementation of user-level threads.

  

Source: Aycock, John - Department of Computer Science, University of Calgary

 

Collections: Computer Technologies and Information Sciences