Removing Useless Productions of a Context Free Grammar through Petri Net
Mansoor Al-A'ali & Ali A. Khan
Journal of Computer Science, Volume 3, Issue 7, pp. 494–498 · doi.org/10.3844/jcssp.2007.494.498
Abstract
Following the proposal for a Petri Net (PN) representation of the Context Free Grammar (CFG)[1], we propose in this paper, an algorithm to eliminate the useless productions of CFG. First the CFG is represented by a PN. Then, based on the reachability, an algorithm is developed to eliminate Useless-productions. The algorithm is analyzed and implemented in Pascal using examples of a CFG. The proposed algorithm is better than the existing techniques in the sense that PN model is easy to understand and requires fewer computations and easily implemented on computers.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2007 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Al-A'ali, M. & Khan, A. A. (2007). Removing Useless Productions of a Context Free Grammar through Petri Net. Journal of Computer Science, 3(7), 494–498. https://doi.org/10.3844/jcssp.2007.494.498
- Licence
- © Science Publications
- Issue
- Volume 3, Issue 7
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record