In: Petri Net Newsletter No. 49, pages 36-42. October 1995.
Abstract: An interpretation of language recognisers for context-free languages using Petri nets is presented. It is shown how to construct such recognisers for strings in L(G) for a given context-free grammar G. The principal steps of the recogniser construction are considered. An example is given as an illustration of this approach.
Keywords: context free grammar; recogniser; string; petri net; tokenstack.