TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Turning vaguely reassuring finite-state machines into regular expressions

68 pointsby Ivoahover 4 years ago

3 comments

graphpapaover 4 years ago
I’m just doing a module in formal languages &amp; automata now but hadn’t yet made the connection that they were related to regular expressions. Neat!<p>Great read, very clearly explained &amp; what a nice programming project too, writing a solver like that - would be great to stick a diagram-parsing front-end on it and then I could solve all my homework problems in double quick time.
评论 #25500643 未加载
评论 #25501210 未加载
评论 #25500905 未加载
MaxBarracloughover 4 years ago
Related: For doing the opposite, Ragel is able to translate regex into a graph, visually depicted courtesy of Graphviz.<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Graphviz" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Graphviz</a>
rendallover 4 years ago
I follow Vaguely Reassuring Finite-State Machines on Twitter and had not realized it had such depths. What a delightful article