Parenthesis Grammars
暂无分享,去创建一个
A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.
[1] Robert W. Floyd,et al. Bounded context syntactic analysis , 1964, CACM.
[2] John B. Johnston. A class of unambiguous computer languages , 1965, CACM.
[3] Journal of the Association for Computing Machinery , 1961, Nature.
[4] Seymour Ginsburg,et al. Bracketed Context-Free Languages , 1967, J. Comput. Syst. Sci..