/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.stevenlevithan.com
|
|
| | | | | RegexBuddy is one of those tools which, now that I've gotten used to having around, I'd have a hard time living without-kind of like regular expressions themselves. I'm happy to see that the recently released (but little publicized) RegexBuddy 3.0 beta pushes what's already the best regex builder/tester on the market quite a bit further.... | |
| | | | |
www.dgendill.com
|
|
| | | [AI summary] A detailed technical tutorial on building a text-based game engine with Rust and WebAssembly, covering memory management, static variables, and JavaScript interop techniques. | ||
