论文信息 - Towards a 2-Multiple Context-Free Grammar for the 3-Dimensional Dyck Language

Towards a 2-Multiple Context-Free Grammar for the 3-Dimensional Dyck Language

We discuss the open problem of parsing the Dyck language of 3 symbols, \(D^3\), using a 2-Multiple Context-Free Grammar. We attempt to tackle this problem by implementing a number of novel meta-grammatical techniques and present the associated software packages we developed.

Orestis Melkonian | Konstantinos Kogkalidis | Konstantinos Kogkalidis | Orestis Melkonian

[1] Peter Ljunglöf. Practical Parsing of Parallel Multiple Context-Free Grammars , 2012, TAG.

[2] Michael Moortgat. A Note on Multidimensional Dyck Languages , 2014, Categories and Types in Logic, Language, and Physics.

[3] Sylvain Salvati,et al. MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies , 2015, J. Comput. Syst. Sci..

[4] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.

[5] Makoto Kanazawa,et al. MIX Is Not a Tree-Adjoining Language , 2012, ACL.

[6] Thomas W. Reps,et al. Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.

[7] Tadao Kasami,et al. On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[8] Giorgio Satta,et al. Partially ordered multiset context-free grammars and ID/LP parsing , 2003 .

[9] Thomas W. Reps,et al. Program analysis via graph reachability , 1997, Inf. Softw. Technol..

[10] Krishnendu Chatterjee,et al. Optimal Dyck reachability for data-dependence and alias analysis , 2017, Proc. ACM Program. Lang..

[11] Greg Kuperberg. Spiders for rank 2 Lie algebras , 1996 .

[12] Adriaan van Wijngaarden,et al. The Generative Power of Two-Level Grammars , 1974, ICALP.

[13] Mike Reape,et al. Getting things in order , 1996 .

[14] Gerald Gazdar,et al. Phrase Structure Grammar , 1982 .

[15] T. Kyle Petersen,et al. Promotion and cyclic sieving via webs , 2008, 0804.3375.