Algorithms for constructing parser states for CFR language

Бесплатный доступ

We consider algorithms for constructing parser's states determined with the special translational context-free grammar in regular form.

Cfr-grammars, generalized regular expression

Короткий адрес: https://sciup.org/14835197

IDR: 14835197   |   DOI: 10.18101/2304-5728-2016-4-23-33

Статья научная