Your Memory's Leaking [duplicate]

Question

Your task is to write a program that:

• Runs indefinitely
• Produces no output
• Consumes an unbounded amount of memory

Specifications

• You must list the implementation used for your program. This is relevant because some implementations might preform optimizations while others do not. For example, the LISP code (defun f () (f)) (f) may or may not consume infinite memory depending on whether the implementation optimizes tail recursion.
• Obviously, your program may terminate from running out of memory.

Examples

BF:

+[>+]

Python:

l = []
while True:
    l.append(1)

JavaScript:

l = [];
while (true)
    l.push(1);

C (I'm not sure if this works):

#include <stdio.h>
int main() {
    while (1)
        malloc(1);
}

---

This is code-golf, so the shortest valid solution (in bytes) wins.

Answer 1

Jelly, 2 bytes

‘ß

Increments and calls itself recursively. As the integer gets bigger, more memory is required to store it.

You can Try it online!, but it's not much to look at.

Answer 2

Python 3, 16 bytes

i=9
while i:i*=9

As ints in Python3 are only limited by the memory, this will run until there is no more memory available.

Answer 3

Befunge-98, 1 byte

'

Fills the stack with strings containing '

Answer 4

Java (OpenJDK 9), 75 bytes

interface G{static void main(String[]a){a=new String[1];for(;;)a[0]+=' ';}}

Try it online!

Answer 5

Bash, 17 bytes

for((;;)){ a+=a;}

Try it online!

Answer 6

Brain-Flak, 8 bytes

(()){()}

Try it online!

Answer 7

Vim, 13 bytes

qqaa<esc>"Ax@qq@q

This defines a macro, q that appends the letter a to the register A and then calls itself. This results in an infinite loop of making register A bigger and bigger, only limited by memory.

Answer 8

Ruby, 15 bytes

i=[];loop{i<<0}