Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with lexical-analysis
Search options answers only
not deleted
user 104803
Lexical analysis is the process of converting a sequence of characters into a sequence of tokens.
3
votes
Optimization of a custom interpreter
First of all: I know, it is fun to implement your own parser from scratch and it is also reasonable for getting a better understanding of how parsers work... however if your goal is to build a custom …
- 8,538
11
votes
Compiler Tokenizer implementation in C#
Your code looks very clean and organized.
Only some comments (without understanding the code in depth)
You would probably use the regex option RegexOptions.Compiled to improve performance
The Token …
- 8,538