Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #2394
| From | Andy <borucki.andrzej@gmail.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Fragments |
| Date | 2019-12-21 01:52 -0800 |
| Organization | Compilers Central |
| Message-ID | <19-12-013@comp.compilers> (permalink) |
In examples is usually used very small alphabet: 3 to 5 letters but in lexical analysing is not only Ascii but many thousands of Unicode. Many chars are grouped by the same action: for example digits->a letter->b whitepsaces->c We can use "fragments" [A-Za-z], [0-9] instead of alone letters. Problem that fragments not always are disjoint: digits and all chars, letters and letter 'a', etc. How to handle with not disjoint fragments? on input we get regular expression in Posix standard and we want make DFA with a few transitions.
Back to comp.compilers | Previous | Next — Next in thread | Find similar
Fragments Andy <borucki.andrzej@gmail.com> - 2019-12-21 01:52 -0800 Re: Fragments Kaz Kylheku <493-878-3164@kylheku.com> - 2019-12-21 20:07 +0000 Re: Fragments Ben Hanson <jamin.hanson@googlemail.com> - 2019-12-22 11:08 -0800
csiph-web