Computation: finite and infinite machines
Computation: finite and infinite machines
The SNOBOL 4 programming language
The SNOBOL 4 programming language
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Recent developments in the theory of data structures
Computer Languages
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.00 |
A formal idealization of the data structures used in many ''list processing'' languages is defined. It is then shown that under a natural interpretation, these data structures define exactly the context-free languages of automata theory. Then a generalization in the direction of the ''patterns'' of SNOBOL is made. It is observed that this generalization models the ability of SNOBOL patterns to represent noncontext-free languages. Finally, it is shown that under certain restrictions, only context-sensitive languages are represented but that in general noncontext-sensitive languages can occur.