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 interpreter
Search options not deleted
user 91213
Tasks involving writing interpreters for various languages or formalisms.
16
votes
8
answers
7k
views
Implement a 2fuck interpreter
The program can be passed to the interpreter as a two dimensional array or a simple string featuring line breaks. …
- 13.5k
13
votes
Implement a simple stack language
Regex (PCRE 2), 104 bytes (60 + 46)
+2 bytes to properly remove excess spaces after ~ commands
Search:
((1+) (1+) a)|((1+) \5(1+) -)|((1+) :)|((1+) (1+) s)|(1+ ~ ?)
Replacement:
${1:+$2$3:${4:+$6:$ …
- 13.5k
1
vote
Make a Brainfuck Interpreter
Rust + -C overflow-checks=off, 370 bytes
|p:&[u8]|{let(mut o,mut c,mut t,mut k)=(0,0,[0;128],0);loop{match p[o]{62=>c+=1,60=>c-=1,43=>t[c]+=1,45=>t[c]-=1,46=>print!("{}",t[c]as char),44=>t[c]=stdin(). …
- 13.5k
1
vote
Write a Deadfish Interpreter
><> (Fish), 49 bytes
05i8%.
1+v
:*v
1-v
:nv
0.\:01-=}:"Ā"={+0$?$~0
Try it
Beats the existing answer by about 30 bytes. Branchless -1 and 256 checking logic copied from this excellent answer
- 13.5k