Towards a programming language based on the notion of two-level grammar
Two level grammars (TLG for short) are a tool of programming language definition. In the paper a variant of TLG called transparent TLG is introduced. Transparent TLG's produce unambiguous CF grammars only and have other regularity properties. It is shown that transparent TLG's can be in some sense considered as a generalization of Horn clauses. Using transparent TLG's we can define certain computations. TLG's can be given, roughly speaking, in a form of programs in an Algol 68 like language. The possibility to use Prolog language in the area is mentioned.
scientific article; zbMATH DE number 3862466