论文信息 - Earley's Parsing Algorithm and k-Petri Net Controlled Grammars

Earley's Parsing Algorithm and k-Petri Net Controlled Grammars

In this paper we modify Earley’s parsing algorithm to parse words generated by Petri net controlled grammars. Adding a vector which corresponds to a marking of a Petri net to Earley’s algorithm, it is shown that languages generated by a subclass of k-Petri net controlled grammars (introduced by J. Dassow and S. Turaev) are parsed in polynomial time of the length of a word.

Taishin Y. Nishida | T. Nishida

[1] Wolfgang Reisig,et al. Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[2] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .

[3] Wojciech Rytter,et al. On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[4] Sherzod Turaev,et al. Petri Net Controlled Grammars with a Bounded Number of Additional Places , 2010, Acta Cybern..

[5] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[6] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.

[7] Sherzod Turaev,et al. Petri Net Controlled Grammars: the Case of Special Petri Nets , 2009, J. Univers. Comput. Sci..

[8] Maurice H. ter Beek,et al. Petri Net Control for Grammar Systems , 2002, Formal and Natural Computing.

[9] Hartmut Ehrig,et al. Formal and Natural Computing , 2002, Lecture Notes in Computer Science.

[10] Sherzod Turaev,et al. k-Petri Net Controlled Grammars , 2008, LATA.

[11] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[12] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[13] René David,et al. Petri nets and grafcet - tools for modelling discrete event systems , 1992 .