Are two contex-free languages translatable in a syntax-directed translation scheme?
暂无分享,去创建一个
[1] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.
[2] Seymour Ginsburg,et al. Solvability of Machine Mappings of Regular Sets to Regular Sets , 1964, JACM.
[3] Alfred V. Aho,et al. Properties of Syntax Directed Translations , 1969, J. Comput. Syst. Sci..
[4] Stefano Crespi-Reghizzi. Approximation of Phrase Markers by Regular Sets , 1972, ICALP.
[5] Luigi Petrone,et al. Syntax Directed Mappings of Context-Free Languages , 1968, SWAT.
[6] Seymour Ginsburg,et al. Some Recursively Unsolvable Problems in ALGOL-Like Languages , 1963, JACM.
[7] Alfred V. Aho,et al. Syntax Directed Translations and the Pushdown Assembler , 1969, J. Comput. Syst. Sci..
[8] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[9] Alfred V. Aho,et al. Translations on a Context-Free Grammar , 1971, Inf. Control..