/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 rcoh.me
No Magic: Regular Expressions, Part 3
| | actually.fyi
Comptime table generation for shift-based DFAs | Actually.fyi
2.7 parsecs away

Travel
| | Ergonomic lookup table generation for bit-twiddling using compile time reflection.
| | ahmedhosssam.github.io
Ahmed Hossam
2.9 parsecs away

Travel
| | The lexical analyzer (lexer) takes a stream of characters and produces a stream of names, keywords, and punctuation marks; it discards white space and comments between the tokens. Lexical tokens have types in any programming language, example: ID foo, x, n14 NUM 73, 0, 082 REAL 3.14, 10., 1e9, 0.5 COMMA , NOTEQ != LPAREN ( RPAREN ) Punctuation tokens such as IF, VOID , RETURN constructed from alphabetic characters are called reserved words and, in most languages, cannot be used as identifiers.
| | pbrisbin.com
Regular Expression Evaluation via Finite Automata | pbrisbin dot com
2.8 parsecs away

Travel
| | While reading Understanding Computation again last night, I was going back through the chapter where Tom Stuart describes deterministic and non-deterministic finite automata. These simple state machines seem like little more than a teaching tool, but he eventually uses them as the implementation for a regular expression matcher. I thought seeing this concrete use for such an abstract idea was interesting and wanted to re-enforce the ideas by implementing such a system myself - with Haskell, of course.
| | rachelcarmena.github.io
Functional programming sparks joy 2 | Rachel M. Carmena
23.5 parsecs away

Travel
| Some characteristics of functional programming