Explore >> Select a destination
|
You are here 
|
swtch.com | ||
| | | | |
pbrisbin.com
|
|
| | | | | 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
|
|
| | | | | 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. | |
| | | | |
rcoh.me
|
|
| | | | | Russell Cohen's Blog and Website | |
| | | | |
initialcommit.com
|
|
| | | If you are thinking about a career in the IT field, it is likely that you will want to know what degree programs are necessary for entering this field. | ||
