On Elimination of Erasing Rules from E0S Grammars
-
Published:2022-07
Issue:2 (89)
Volume:30
Page:135-147
-
ISSN:1561-4042
-
Container-title:Computer Science Journal of Moldova
-
language:
-
Short-container-title:CSJM
Author:
Meduna Alexander, ,Havel Martin,
Abstract
The present paper describes an alternative algorithm for the removal of erasing rules from E0S grammars. As opposed to the standard way of eliminating erasing rules in most E0S-like grammars, such as context-free grammars, this method requires no predetermination of symbols that derive the empty string. The proposed algorithm is formally verified. In the conclusion of the paper, the applicability of the algorithm to E0S grammars that work in a semi-parallel way is demonstrated. Furthermore, two open problems are formulated.
Publisher
Vladimir Andrunachievici Institute of Mathematics and Computer Science
Subject
Artificial Intelligence,Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Computer Networks and Communications,Computer Science Applications,Modeling and Simulation,Software