Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ter Beek, M., Kleijn, J.: Petri Net Control for Grammar Systems. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 220–243. Springer, Heidelberg (2002)
Dassow, J., Păun, G.: Regulated rewriting in formal language theory. Springer, Berlin (1989)
Dassow, J., Turaev, S.: k-Petri Net Controlled Grammars. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 209–220. Springer, Heidelberg (2008)
Dassow, J., Turaev, S.: Petri net controlled grammars: the case of special Petri nets. Journal of Universal Computer Science 14, 2808–2835 (2009)
Dassow, J., Turaev, S.: Petri net controlled grammars: the power of labeling and final markings. Romanian Journal of Information Science and Technology 12, 191–207 (2009)
Dassow, J., Turaev, S.: Petri net controlled grammars with a bounded number of additional places. Acta Cybernetica 19, 609–634 (2010)
David, R., Alla, H.: Petri nets and grafcet: tool for modelling discrete event systems. Prentice Hall, Hertfordshire (1992)
Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13, 94–102 (1970)
Hopcroft, J.H., Ullman, J.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)
Kasami, T.: An efficient recognition and syntax algorithm for context-free languages, Scientific Report AFCRL-65-758, Air force Cambridge Research Lab., Bedford, Mass (1965)
Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1491. Springer, Heidelberg (1998)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1-3. Springer, Berlin (1997)
Turaev, S.: Petri net controlled grammars. In: Proc. 3rd Doctoral Workshop on MEMICS 2007, Znojmo, Czech Republic, pp. 233–240 (2007)
Younger, D.H.: Recognition and parsing of context-free languages in time n3. Information and Control 10, 189–208 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nishida, T.Y. (2012). Earley’s Parsing Algorithm and k-Petri Net Controlled Grammars. In: Bordihn, H., Kutrib, M., Truthe, B. (eds) Languages Alive. Lecture Notes in Computer Science, vol 7300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31644-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-31644-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31643-2
Online ISBN: 978-3-642-31644-9
eBook Packages: Computer ScienceComputer Science (R0)