Automaton characteristic of methods of syntactic analysis with regular control
作者： A. V. Anisimov
DOI: 10.1007/BF01070336
关键词:
摘要:
springer.com
sci-hub.se 参考文章(13)
Karel Čulik, Rina Cohen, LR-regular grammars-an extension of LR(k) grammars Journal of Computer and System Sciences. ,vol. 7, pp. 66- 96 ,(1973) , 10.1016/S0022-0000(73)80050-9
W. J. Chandler, Abstract families of deterministic languages symposium on the theory of computing. pp. 21- 30 ,(1969) , 10.1145/800169.805418
Alexander Birman, Jeffrey D. Ullman, Parsing algorithms with backtrack Information & Computation. ,vol. 23, pp. 1- 34 ,(1973) , 10.1016/S0019-9958(73)90851-6
Franklin L. DeRemer, Simple
LR(k)
grammars Communications of the ACM. ,vol. 14, pp. 453- 460 ,(1971) , 10.1145/362619.362625
Donald E. Knuth, Top-down syntax analysis Acta Informatica. ,vol. 1, pp. 79- 110 ,(1971) , 10.1007/BF00289517
D.J. Rosenkrantz, R.E. Stearns, Properties of deterministic top-down grammars Information & Computation. ,vol. 17, pp. 226- 256 ,(1970) , 10.1016/S0019-9958(70)90446-8
F.C. Hennie, One-tape, off-line Turing machine computations Information & Computation. ,vol. 8, pp. 553- 578 ,(1965) , 10.1016/S0019-9958(65)90399-2
Donald E. Knuth, On the translation of languages from left to right Information & Computation. ,vol. 8, pp. 607- 639 ,(1965) , 10.1016/S0019-9958(65)90426-2
Jerome Feldman, David Gries, Translator writing systems Communications of The ACM. ,vol. 11, pp. 77- 113 ,(1968) , 10.1145/362896.362902
Robert W. Floyd, Bounded context syntactic analysis Communications of the ACM. ,vol. 7, pp. 62- 67 ,(1964) , 10.1145/363921.363927