On the Comparison of Context-Free Grammars

In this paper we consider the problem of context-free grammars comparison from the analysis point of view. We show that the problem can be reduced to numerical solution of systems of nonlinear matrix equations. The approach presented here forms a basis for probabilistic comparison algorithms oriented to automatic assessment of of student's answers in computer science.

[1]  Nelma Moreira,et al.  Finite Automata Minimization , 2012, Handbook of Finite State Based Models and Applications.

[2]  Kenneth A. Ribet,et al.  Modular elliptic curves and fermat's last theorem , 1993 .

[3]  Sumit Gulwani,et al.  Towards Automating Grammar Equivalence Checking , 2015 .

[4]  Stephen H. Unger,et al.  Structural Equivalence of Context-Free Grammars , 1968, J. Comput. Syst. Sci..

[5]  Patrick Cousot,et al.  Grammar Analysis and Parsing by Abstract Interpretation , 2006, Program Analysis and Compilation.

[6]  José João Almeida,et al.  Context-Free Grammars: Exercise Generation and Probabilistic Assessment , 2016, SLATE.

[7]  M. Schützenberger.  On a Theorem of R. Jungen , 1962 .

[8]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[9]  Nelma Moreira,et al.  Testing the Equivalence of Regular Languages , 2010, J. Autom. Lang. Comb..

[10]  Sumit Gulwani,et al.  Automating grammar comparison , 2015, OOPSLA.

[11]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[12]  Hans Leiß,et al.  To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm , 2009, Informatica Didact..

[13]  Patrick Cousot,et al.  Grammar semantics, analysis and parsing by abstract interpretation , 2011, Theor. Comput. Sci..