/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

 swtch.com
Implementing Regular Expressions
| | deniskyashif.com
Implementing a Regular Expression Engine ยท Denis Kyashif's Blog
2.3 parsecs away

Travel
| | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm.
| | pbrisbin.com
Regular Expression Evaluation via Finite Automata | pbrisbin dot com
5.6 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.
| | ahmedhosssam.github.io
Ahmed Hossam
4.1 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.
| | joeprevite.com
Rust Lang Book - Chapter 4 Notes
16.2 parsecs away

Travel
| My notes from Chapter 4 of the Rust Lang Book.