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 parsing
Search options not deleted
user 91213
This tag denotes challenges where parsing input is a large / the main part of the challenge.
4
votes
3
answers
360
views
Operators modify in place, fix my expressions [closed]
I'm using a language "MutFk" where the basic operators like "+" and "*" actually modify the left hand side of the expression, and also return the modified version. For example:
> x = 5
> x+3
8
> x
8
> …
- 13.5k
2
votes
Decipher a squashed sequence
Rust, 242 235 bytes
|t:Vec<u64>|(0..).map(|v|{let mut y=vec![];y.extend(t.iter().scan((v,0),|(a,b),c|Some(if *b*10+c==*a+1{*a=c+*b*10;*b=0;Some(*a)}else{*b=*b*10+c;None})));y.last().unwrap().and(Some( …
- 13.5k
7
votes
Parse basic arithmetic into an AST
Python, 69 68 bytes
f=lambda x:[*([i,*map(f,x.split(i,1))]for i in'-+/*'if i in x),x][0]
Attempt This Online!
- 13.5k
14
votes
Is it a valid Go type?
Regex (PCRE), 241 bytes
^(bool|u?int|float(32|64)|complex(64|128)|byte|rune|string|&\s*(?1)|\*\s*(?1)|\[\s*\d*\s*\]\s*(?1)|map\s*\[\s*(?1)\s*\]\s*(?1)|chan (?1)|struct\s*\{\s*(|((?1);\s*)*\s*(?1)\s*;? …
- 13.5k