4 ms·
I know this and I don’t have a formal education in computer science. In general you don’t need to pay someone to tell you to read books. You can just read them
by umanwizard 7y ago
I know this and I don’t have a formal education in computer science.
In general you don’t need to pay someone to tell you to read books. You can just read them.
- dgb23 7y agoThat is certainly true but these theoretical concepts don't seem to have obvious/tangible benefits at first, so it is very understandable that many who are self-taught wouldn't know much about them.
- tomxor 7y agoThis is true for me, i'm unlikely to have learnt about this unless it particularly interested me.
- tomxor 7y agoOut of interest, what book did you read that explained this? I know a bit about FSMs, but for regex I only know they are based on them - However my self learning tends to be more impulsive and reactive.
- umanwizard 7y agoI don’t remember, since I’ve known about this construction for years. Could just be some lecture notes I downloaded from somewhere.
- edflsafoiewq 7y agoI think I learned this because of the pumping lemma for regular languages. In the FSM picture, it becomes totally obvious: every sufficiently long path in a finite graph contains a loop.
- pubby 7y agoThe "Dragon" compiler book is pretty comprehensive on regex.