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 tokens
Search options answers only
not deleted
user 89
For questions relating to tokens, or the data structure that contains information about the raw components of source code
2
votes
Negative literals, or unary negated positive literals?
If you do, then x-1 will be lexed as two tokens ─ an identifier x followed by a literal -1 ─ and then you can't parse it as a binary operator expression like x - 1, unless your parser has a weird special …
- 20.8k
5
votes
Do parsers typically need access to all tokens?
What influences the decision?
Some languages cannot be lexed without also being parsed (or in the notable case of TeX, cannot be lexed without also being executed). In this case, the only option is …
- 20.8k