Two-level meta-controlled substitution grammars
暂无分享,去创建一个
[1] B. J. Mailloux,et al. Report on the Algorithmic Language ALGOL 68 , 1969 .
[2] J. Bormann. A. van Wijngaarden (Ed.), B. J. Mailloux, J. E. L. Peck and C. H. A. Koster, Report on the Algorithmic Language ALGOL 68. Amsterdam 1969. Printing by the Mathematisch Centrum. Preis brosch. $ 4.50 . , 1970 .
[3] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[4] Joost Engelfriet,et al. Copying Theorems , 1976, Information Processing Letters.
[5] Arto Salomaa,et al. Parallelism in Rewriting Systems , 1974, ICALP.
[6] Sheila A. Greibach,et al. Some restrictions on W-grammars , 1974, STOC '74.
[7] John L. Baker,et al. Grammars with Structured Vocabulary: a Model for the \sc algol-68 Definition , 1972, Inf. Control..
[8] Adriaan van Wijngaarden,et al. Orthogonal design and description of a formal language , 1965 .
[9] Rani Siromoney,et al. Parallel Context-Free Languages , 1974, Inf. Control..
[10] B. J. Mailloux,et al. Report on the Algorithmic Language , 1971 .
[11] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.
[12] Peter C. Chapin. Formal languages I , 1973, CSC '73.
[13] Grzegorz Rozenberg,et al. Extension of tabled 0L-systems and languages , 1973, International Journal of Computer & Information Sciences.
[14] B. J. Mailloux,et al. Report of Algorithmic Language ALGOL 68 , 1969 .
[15] Grzegorz Rozenberg,et al. Theory of L Systems: from the point of view of formal language theory , 1974, L Systems.