Towards a programming language based on the notion of two-level grammar (Q795514)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3862466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a programming language based on the notion of two-level grammar |
scientific article; zbMATH DE number 3862466 |
Statements
Towards a programming language based on the notion of two-level grammar (English)
0 references
1984
0 references
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.
0 references
transparent grammars
0 references
Two level grammars
0 references
programming language
0 references
Horn clauses
0 references
0.8304145932197571
0 references
0.76497882604599
0 references
0.749857485294342
0 references
0.7233806848526001
0 references
