Notice: Undefined index: linkPowrot in C:\wwwroot\wwwroot\publikacje\publikacje.php on line 1275
[22970] Artykuł: Formalization of context-free grammars by means of modified algebra of algorithmsCzasopismo: Proceedings of the international conference on COMPUTER SCIENCE & INFORMATION TECHNOLOGIES (CSIT’2015), 14-17 SEPTEMBER 2015, LVIV, UKRAINE Strony: 84-87ISBN: 978-6-1760-7808-1 Wydawca: IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA Opublikowano: Wrzesień 2015 Autorzy / Redaktorzy / Twórcy
Grupa MNiSW: Materiały z konferencji międzynarodowej (zarejestrowane w Web of Science) Punkty MNiSW: 15 Klasyfikacja Web of Science: Proceedings Paper ![]() ![]() Keywords: Keywords - grammar  inference rules  language  Backus-Naur Form  modified algebra of algorithms.  |
Abstract - We consider the use of the modified algebra of algorithms to formalize the grammars and derivations of context-free grammars. The inference rules and the derivations themselves of several applied grammars have been given by formulas of modified algebra of algorithms. We illustrate the use of operations of sequencing as well as operations of paralleling to describe the inference rules.