Explore >> Select a destination
|
You are here 
|
pbrisbin.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. | |
| | | | |
diego.codes
|
|
| | | | | Data Scientist. I like music, keyboards and Legos. Proficient in pop culture references and xkcd. | |
| | | | |
deniskyashif.com
|
|
| | | | | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm. | |
| | | | |
jorenar.com
|
|
| | | [AI summary] The provided text is a comprehensive overview of various advanced C programming techniques and features. It covers topics such as preprocessor tricks, metaprogramming, inline assembly, coroutines, and more. The text also includes examples of using _Generic for type-based dispatch, handling variadic functions safely, and implementing a garbage collector. The content is highly technical and demonstrates the flexibility and power of the C language. | ||
