Abstract
Abstract
The polynomial realized formulas are introduced with quantifiers acting on hierarchy lists described by CF-grammars. Upper estimates of execution complexity are obtained depending from the sort of grammar. These formulas have been applied for formal definition of context-dependent syntax of programming languages and describing dynamic discrete system.
Subject
General Physics and Astronomy
Reference10 articles.
1. Compiler construction using attribute grammars;Koskimes;SIGPLAN Notices,1982
2. Defining context-dependent syntax without using context;Odersky;Transaction Programming Languages and Systems,,1993
3. Computer aided parsing and context analysis in compiler construction system;Glushkova;Kibernetika,,1985