Каскадный метод регуляризации КС-грамматик.

Authors

  • Boris Martynenko

Keywords:

: context-free grammar, regular expression, dependence relation, topological sorting of nonterminals, equivalent conversion of grammar

Abstract

The method for the regularization of reduced non-self-embedding context-free grammars, based on the topological sorting of nonterminals of the grammar according the relation of the dependence defined by the grammar rules, is described.

Downloads

Published

2012-04-30

Issue

No. 2 (2012)

Section

Computer science

License

Public offer

How to Cite

[1]
“Каскадный метод регуляризации КС-грамматик”., Comput. Tools Educ., no. 2, Apr. 2012, Accessed: Oct. 23, 2026. Available: http://cte.eltech.ru/ojs/index.php/kio/article/view/1298

Most read articles by the same author(s)