/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
| | 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.
| | 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.
| | rcoh.me
Russell Cohen
4.9 parsecs away

Travel
| | Russell Cohen's Blog and Website
| | nurkiewicz.com
#92: Clojure: a languages that will change the way you think about programming
16.4 parsecs away

Travel
| Clojure is a dynamically, strongly typed programming language. It's a dialect of _Lisp_ running on the Java Virtual Machine. Lisp is 6 decades old and has a really weird syntax. That weird syntax is called _Polish prefix notation_. Basically, in every other language you've used math operators like plus or minus are infix. It means they are placed between operands. For example, `1 + 2`. In Clojure, you always put the operator (or any other function for that matter) in front. So simple addition becomes... `+ 1 2`.