/explore
|
You are here 
|
www.dalkescientific.com | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
swtch.com
[AI summary] This article compiles resources and implementations for creating efficient regular expression search algorithms using finite automata and DFA/NFA methods. |
|
| | | | | ||
| | | | |
blog.martinig.ch
Architecture is an important asset for good programming and the notion of "pattern" is here to help us apply already trusted code architecture solutions to common problems. Jason McDonald has done a wonderful job to group some of them in a document that should be useful to most software developers. Go to his blog to |
|
| | | | | ||
| | | | |
renato.athaydes.com
|
|
| | | |||
