On Elimination of Erasing Rules from E0S Grammars
Computer Science Journal of Moldova · 2022
DOI: 10.56415/csjm.v30.08 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science Journal of Moldova, 2022. Verfasst von Alexander Meduna und 1 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Meduna, A., & Havel, M. (2022). On Elimination of Erasing Rules from E0S Grammars. Computer Science Journal of Moldova. https://doi.org/10.56415/csjm.v30.08
Vancouver
Meduna A, Havel M. On Elimination of Erasing Rules from E0S Grammars. Computer Science Journal of Moldova. 2022. doi:10.56415/csjm.v30.08
BibTeX
@article{Meduna2022,
author = {Meduna, Alexander and Havel, Martin},
title = {On Elimination of Erasing Rules from E0S Grammars},
journal = {Computer Science Journal of Moldova},
year = {2022},
doi = {10.56415/csjm.v30.08}
}
EUVIMED