A Program Execution Model Based on Generative Dynamic Grammars

J. Aycock (Canada)


Compilers, operating systems, data compression, formallanguages


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.

Important Links:

Go Back