原书出处
Natural Language Processing in Action, Second Edition
This formal grammar and finite state machine approach to pattern matching has some other awesome features. A true finite state machine is guaranteed to eventually stop (halt) in a finite number of steps. So if you use a regular expression as your pattern matcher, you know that you will always receive an answer to your question about whether you’ve found a match in your string
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Natural Language Processing in Action, Second Edition/_epub-src/OEBPS/Text/chapter-11.html
EPUB SHA-256:0e9a35e49ca446e322e5524e53f39fb6bee5b2b23d9cda10ef052aca770b0b36