Hello, Arsen. Shnurkov, you wrote: AS> I already created a subject the Author: Arsen. Shnurkov Date: 06.01 11:19 about it, but it is entirely cunning in and did not return. AS> well or at least tell, how it is written "Janusz Brzozowski" in Russian (Russian letters). And what there the difficult? It is necessary to write first of all a parcer for the regular expressions. To make it not difficult normal store automatic machine with a priority of operators. Operators there three: concatenation (there is no character), alternative (|) and iteration (*). The automatic machine can be built it is inductive on structure of assorted expression. For a character the automatic machine from two states, from initial passage in admitting on a character. For operators it is possible to construct automatic machines from already constructed automatic machines of operands through so-called epsilons-transitions. It is possible and without them, but with such passages is easier. And of the automatic machine about an epsilon passages to construct normal very simply algorithm of closing on an automatic machine transition graph. I wrote about 10 years ago this business on pluses if so it will be already necessary I can send the code. To look at the code of the same PIRE the link, there truth to a bison a parcer it is written even easier, but the idea is implemented.