TY  - JOUR
AU  - Al-A'ali, Mansoor 
AU  - Khan, Ali A. 
PY  - 2007
TI  - Removing Useless Productions of a Context Free Grammar through Petri Net
JF  - Journal of Computer Science
VL  - 3
IS  - 7
DO  - 10.3844/jcssp.2007.494.498
UR  - https://thescipub.com/abstract/jcssp.2007.494.498
AB  - 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.