The original brainfuck distribution written by Urban Müller in 1993 has a
few example programs in it one of these is a prime number generator.

I would expect a brainfuck interpreter to be able to run this code
hsbrainfuck cannot!

I would expect a reasonable brainfuck interpreter to get to 255 in less
than twenty seconds. A good one will be subsecond.

Download:       http://aminet.net/dev/lang/brainfuck-2.lha
Readme:         http://aminet.net/dev/lang/brainfuck-2.readme

Extracted copy of prime.b
https://github.com/rdebath/Brainfuck/raw/a7caec11b54dd960ecf6172b58822997b5208bb9/src/prime.b

Slightly 'modernised' version of prime.b
https://github.com/rdebath/Brainfuck/raw/master/testing/Prime.b

Hi,


Am Sonntag, den 09.11.2014, 20:53 +0000 schrieb Robert de Bath:

thanks for your report. It seems that hsbrainfuck is not maintianed by
upstream any more. Maybe we should just remove it, and patch lambdabot
not to use it.

Greetings,
Joachim

Ah, that explains it, it's not supposed to be a standalone interpreter.

I would say that it's not really useful on it's own ('useful' as a
programmer's toy that is.)  as it can't run anthing that uses the input
command or takes more than a few million BF instructions. I suspect it's
specifically designed as the reverse of a dumb text to BF converter.

ie: the most complicated it expects is something like:

+++++++++++[>+++>+++++++>++++++++++>+++++++++>+<<<<<-]>>---.>+.>--.++.+
++++.+.<--.<<-.>--------.>+++++.>----.++++.<++.------.>----.<++++.>>-.

So, yes, it can go as a standalone package, but it may be reasonable to
merge it into the lambdabot package as a contrib or something.