Questions tagged [interpreter]
Tasks involving writing interpreters for various languages or formalisms.
127
questions
20
votes
10
answers
905
views
Implement Subleq
Subleq is a Turing-complete esolang with only one instruction, SUBLEQ. This instruction takes in three parameters, A, B, and <...
- 6,239
16
votes
8
answers
7k
views
Implement a 2fuck interpreter
2fuck is a simple 2D variation on brainfuck. Like traditional brainfuck, there is an 1D memory tape that extends 30000 bytes to the right from its beginning, consisting of values between 0 and 255.
...
- 11.4k
-1
votes
3
answers
294
views
Make a Brainfuck Interpreter [duplicate]
There already is a Brainfuck interpreter question, but it is from 2011 and not up to date with current site standards and vague in places. I have proposed reposting this in chat, and it was well-...
- 5,271
7
votes
2
answers
289
views
Write a (simplified) BitCycle interpreter
Implement a function or program that can run simplified BitCycle code. The functions you must implement are:
<^>v: Change the direction of a bit to the ...
- 1,357
17
votes
1
answer
4k
views
Simplified Piet Interpreter
Background
Piet is an esoteric stack-based programming language in which programs are images meant to resemble abstract paintings.
To keep the challenge from being unnecessarily complex, you will not ...
- 12.3k
0
votes
5
answers
297
views
Make a +-= Interpreter [duplicate]
+-= is a language created by Esolangs user Anonymous in 2017.The language consists of only three commands:
+ increases the accumulator by one.
...
9
votes
3
answers
1k
views
Build an optimizing Brainfuck compiler/interpreter
the goal
Build an optimizing Brainfuck implementation. Whether it is a compiler, an interpreter, a JIT compiler, or whatever else is up to you.
scoring
A reference implementation (...
- 2,325
7
votes
5
answers
440
views
Inject arbitrary code into a compiler (robbers)
This is the robbers' challenge. To post a cop, go here.
In this challenge, cops will invent a (likely simple) programming language, and write an interpreter, transpiler, or compiler that allows you to ...
- 18.5k
15
votes
9
answers
882
views
Inject arbitrary code into a compiler (cops)
This is the cops' challenge. To post a robber, go here.
In this challenge, cops will invent a (likely simple) programming language, and write an interpreter, transpiler, or compiler that allows you to ...
- 18.5k
13
votes
9
answers
608
views
AoCG2021 Day 16: Interpret Duet
Related to AoC2017 Day 18, Part 2. (Anyone want to add Duet to esolangs?)
Duet is an assembly-like language that involves two processes running the same program simultaneously. Each process of Duet ...
- 73.2k
0
votes
0
answers
76
views
Interpret !@#$%^&*()_+ [duplicate]
!@#$%^&*()_+ is a stack-based programming language created by
Conor O'Brien.
Task
Your task is to Interpret !@#$%^&*()_+ With theese following commands:
Commands:
...
- 2,901
23
votes
8
answers
4k
views
Obfuscate my ><>
><>, or Fish, is a two-dimensional esoteric programming language where the instruction pointer (IP) toroidally moves around the codebox, wrapping when it hits an edge.
><> has four ...
- 34.5k
8
votes
3
answers
745
views
Polyglot Interpreters
Challenge
Choose any number of languages. Call this set L.
Write a program so that running it in any language in L produces an interpreter for a different language ...
- 237
22
votes
11
answers
928
views
Interpret underload
The challenge
Interpret the stack-based programming language underload.
The stack is a stack of strings that can be concatenated together.
Each underload program is a string of some of these ...
- 743
13
votes
5
answers
475
views
Interpret Gelatin
Gelatin is a worse version of Jelly. It is a tacit programming language that always takes a single integer argument and that has 7 (or maybe 16) commands. You are to take in a Gelatin program and its ...
- 49.3k
13
votes
9
answers
1k
views
Execute a Befunge Chess Board
Befunge Chess is an esolang mini-game I invented that is centered around the Befunge esolang. The general gist of the game is to make the instruction pointer land on a specific target cell while ...
- 31.5k
25
votes
17
answers
2k
views
Write an interpreter generator
There are quite a few accumulator-based programming languages featured in challenges across the site, but it's a little tiring to have to write almost identical code for each one. So in this challenge ...
user100690
0
votes
19
answers
645
views
Write an interpreter for "interpreter"
I just created a language on the spot, and it's called "interpreter". Called as such because the only valid word is "interpreter"!
A sample program in "interpreter" looks ...
user100690
17
votes
12
answers
2k
views
Make a !!!Batch compiler/translator
!!!Batch is another derivative of the Windows Batch programming language, its wiki is here
Your challenge is to create an compiler/translator that reads a !!!Batch program and returns a Windows Batch ...
- 12.2k
38
votes
31
answers
2k
views
Evaluate left-or-right
Originally sandboxed by @xnor
Left-or-right is a very simple language @xnor made up. Its expressions are made of arrows < (left), ...
- 73.2k
33
votes
57
answers
5k
views
Write a Deadfish Interpreter
Sandbox, Codidact
A rewrite of this question with a simpler input format and guidelines.
Challenge
Deadfish uses a single accumulator, on which all commands are to be performed.
It has the following ...
- 26.8k
28
votes
58
answers
5k
views
Write a "Hello" interpreter
Background
Hello is a language "written" by Anne Veling, which errors if the program does not contain only h, and will print ...
- 439
14
votes
13
answers
2k
views
Implement SKI combinator calculus
This challenge is to golf an implementation of SKI formal combinator calculus.
Definition
Terms
S, K, and ...
- 1,428
8
votes
3
answers
608
views
SELECT ALL FROM SelectQL WHERE (answer="short" OR NOT length=10000)
I've invented an SQL-like language. Let's call it SelectQL. You can't INSERT anything, you can only SELECT, and I don't have the ...
- 8,258
51
votes
7
answers
7k
views
Build a Turing *incomplete* language
The world is full of Turing-complete programming languages. Just about every useful language (and most useless ones) are Turing-complete. Some even became Turing-complete by accident. Often this is ...
- 39.3k
8
votes
5
answers
1k
views
Build an interpreter for "Goggle kids Code"
Partially inspired by this question.
Overview
The execution of Goggle kids Code starts with an empty binary tape with 100 items, with the pointer starting at the index 0:
...
user92069
16
votes
3
answers
2k
views
Final tribute to John Conway: FRACTRAN self-interpreter
It's time to conclude the series of John Conway challenges of mine.
Background
A FRACTRAN program consists of an ordered list of fractions. The program starts by taking a single integer as input. Each ...
- 73.2k
24
votes
3
answers
1k
views
Write a Whitespace Interpreter
Challenge:
Your challenge is to write an interpreter for Whitespace. Given a string consisting of spaces, tabs, newlines, and potentially other characters, as well as possible inputs for the ...
- 122k
4
votes
4
answers
292
views
Partial tq interpreter
In this task you are expected to provide a list output given an input tq program. The tq programs will not contain whitespace inside them.
What is tq, in the first place?
tq is a lazy-evaluated ...
user85052
11
votes
6
answers
2k
views
Polyglot self-interpreter time
Your task is to make a program which interprets the language it is run in, but also works in many languages.
Let's say you make a Brainfuck-Underload self-interpreglot, as it will be called. Run in ...
- 3,819
6
votes
3
answers
583
views
Minified Intcode Computer
As the trip through the solar system on your way to rescue Santa gets a little droll, so perhaps some optimizations to your Intcode Computer are in order. Namely, making it as small as possible ...
5
votes
1
answer
161
views
Wrong keyboard position [duplicate]
You are in fact writing an interpreter for the language "Wrong keyboard position". You can pretend that you are not doing this and just follow the instructions below.
I typr re;atively accuratrly, ...
user85052
15
votes
13
answers
1k
views
Interpret Volatile
Interpret Volatile
Volatile is a stack-based esolang made by A_/a'_'/A that only has 8 instructions and is turing complete. However, it is also non-deterministic... meaning that programs don't always ...
- 31.5k
5
votes
3
answers
309
views
Write an interpreter for simplified 33
33 is a simple esolang I created. You may have seen me use it in a few questions. You're not going to be writing a full interpreter. The interpreter you will be writing is for a simplified version of ...
- 1,349
20
votes
37
answers
4k
views
Talk interpreter
"Talk" is a baroquified accumulator-based language that is created in response to Dennis's quote on talk.tryitonline.net.
...
user85052
6
votes
7
answers
399
views
Bucket interpreter
Create a program that interprets the programming language Bucket.
Bucket works on two buckets: the first can hold A and the second can hold B units of liquid. The things you can do with these buckets ...
- 3,819
25
votes
35
answers
4k
views
Write an interpreter for *
The task is simple. Write an interpreter for the language *.
Here's a bigger link to the wiki.
There are only three valid * programs:
* Prints "Hello World"
<...
- 1,349
6
votes
1
answer
391
views
Make Plan 9 Cat Turing Complete in as Few Bytes as Possible [closed]
Your task is to modify the original Plan 9 cat tool for UNIX, in order to make it a fully turing complete language interpreter. You may make use of ANSI escape codes and the backspace character (\x08) ...
- 163
13
votes
11
answers
741
views
Simulate Bitwise Cyclic Tag
Challenge
Given two strings in any default I/O format, do the following:
NOTE: The challenge will refer to the first string as the "data" and the second referred to as the "program".
Change the ...
- 2,722
11
votes
6
answers
563
views
String Manipulation Interpreter
Summary
A new string manipulation language has been made, using only the characters $+#-!*|@>! Your task is to implement an interpreter for it in as few bytes ...
- 843
33
votes
5
answers
3k
views
8bit virtual machine
Background
I like my old 8-bit 6502 chip. It's even fun to solve some of the challenges here on PPCG in 6502 machine code. But some things that should be simple (like, read in data or output to stdout)...
- 4,246
12
votes
3
answers
459
views
Solve the Halting Problem for Modilar SNISP
In the spirit of Solve the Halting Problem for Befinge, let's define another 2D language called Modilar SNISP. Modilar SNISP has the following six instructions:
\ ...
- 15.4k
9
votes
5
answers
430
views
Interpret TwoMega
In this challenge, you will write an interpreter for 2Ω (transcribed as TwoMega), a language based loosely on brainfuck with an infinite-dimensional storage space.
The Language
2Ω contains three ...
- 15.4k
14
votes
27
answers
2k
views
Simple golfing interpreter
Challenge:
Your job is to create a simple interpreter for a simple golfing language.
Input:
Input will be in the form of string separated by spaces.
You can replace space separation with what you ...
- 2,621
38
votes
3
answers
1k
views
Build a golfing language with me
A lot of PPCG users helped with the creation of this challenge, both in chat and the Sandbox, specifically Martin Ender, AdmBorkBork, Emigna and user202729
Our community has found it necessary to ...
- 49.3k
34
votes
2
answers
2k
views
Halting Problem for Simplified Hexagony
Introduction
Decide whether a Hexagony program composed solely of the characters .)_|\/><@ will halt using least bytes.
Challenge
Hexagony is a language ...
- 3,627
4
votes
1
answer
316
views
Interpret deadfish [duplicate]
Please participate in the meta discussion about reopening this challenge before casting a vote.
Introduction
This challenge was inspired by semicolon-#.
Deadfish is a non-Turing-complete ...
- 467
12
votes
3
answers
1k
views
RoboZZle interpreter
Your task is to write a RoboZZle interpreter. If you're not familiar with the game, please watch the video at robozzle.com or read my description below.
A robot lives on a rectangular grid of squares ...
- 15.2k
16
votes
6
answers
707
views
Implement Anyfix Notation!
In prefix notation, the operator comes before the arguments, so you can kind of imagine that the operator calls next() which is recursively called. In infix ...
- 41.1k
1
vote
2
answers
527
views
Make a ;#*:) interpreter [duplicate]
A few month back, I made a language called ;# (Semicolon Hash) and it started a little bit of a craze (it even got its own tag, as you can see). But, as with ...
- 49.3k