|
|||||
|
|
Syntax and semantics of universal programming languages |
|
| Abstract: | This paper deals with certain characterizations of the sets of positive integers which when represented as strings on a finite alphabet, form tree adjunct languages, As the context free languages constitute a subfamily of tree adjunct languages, the results carry over to the former as well. |
| Keywords: | Abstract programming language Gödel numbering syntax semantics programming style compiler Hartley Rogers Jr |