1

Topic: Teach, please (on C#) to build on generalized

I already created a subject the Author: Arsen. Shnurkov Date: 06.01 11:19 it, but it is entirely cunning in  and did not return. Well or at least tell, how it is written "Janusz Brzozowski" in Russian (Russian letters).

2

Re: Teach, please (on C#) to build on generalized

Hello, Arsen. Shnurkov, you wrote: AS> Well or at least tell, how it is written "Janusz Brzozowski" in Russian (Russian letters). On idea - Janush Bzhozovsky if I am not mistaken.

3

Re: Teach, please (on C#) to build on generalized

AS> Well or at least tell, how it is written "Janusz Brzozowski" in Russian (Russian letters). Here on python: https://github.com/qntm/greenery/blob/m … ry/lego.py - builds Fsm https://github.com/qntm/greenery/blob/m … ery/fsm.py - itself Fsm There not all is implemented (lookahead, capture of contents of groups, etc.), in the core because of that that the author made the fixed table the character-> a state, and for modern regex the table of functions accepts (c)-> a state is more likely necessary, but algorithm it is visible very well.

4

Re: Teach, please (on C#) to build on generalized

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.

5

Re: Teach, please (on C#) to build on generalized

There are two ready libraries, able including and it: https://github.com/moodmosaic/Fare https://github.com/AutomataDotNet/Automata If functionality, namely an implementation example is necessary not to peep easier in the first since there is easier both the code, and architecture.... <<RSDN@Home 1.3.16 alpha 5 rev. 60>>

6

Re: Teach, please (on C#) to build on generalized

Hello, hi_octane, you wrote: _> There not all is implemented (lookahead, capture of contents of groups, etc.), in the core because of that that the author made the fixed table the character-> a state, and for modern regex the table of functions accepts (c)-> a state is more likely necessary, but algorithm it is visible very well. For modern  the stack automatic machine is necessary if to be more exact. To spread out it in  it is possible, but only under condition of stack fixed size. Thus, the number of states such  will grow on an exhibitor from number of states  and the size of its stack.... <<RSDN@Home 1.3.16 alpha 5 rev. 60>>

7

Re: Teach, please (on C#) to build on generalized

Hello, Tyomchik, you wrote: Those> Set to itself a question - what for it to you it is necessary?, In due time, it was required to me for performance of union operations / intersections of several  in one and creations on it of the optimized automatic machine generating lines recognized to it. To me, truth, functionality of those linguistic data bases links on which resulted above sufficed.... <<RSDN@Home 1.3.16 alpha 5 rev. 60>>

8

Re: Teach, please (on C#) to build on generalized

Hello, Tyomchik, you wrote: Those> For  several  in one, generally it is not necessary to invent the automatic machine.  to construct the optimized tree (the Boolean logician) and to construct 1 . In from it - the standard finite state machine (in Java and C# this automatic machine JIT - ). For join it is not necessary. If it is required to receive as a result recognizing automatic machine. But, as I wrote above, the intersection  (and still addition, by the way) and creation on them not recognizing, and generating automatic machines was required also.