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

DOI10.1007/978-3-642-31644-9_12zbMath1367.68147OpenAlexW105153476MaRDI QIDQ3166951

Taishin Y. Nishida

Publication date: 1 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_12

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (1)

An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• k-Petri Net Controlled Grammars
• Recognition and parsing of context-free languages in time n3
• An efficient context-free parsing algorithm

This page was built for publication: Earley’s Parsing Algorithm and k-Petri Net Controlled Grammars