# HG changeset patch # User Christian Urban # Date 1598316116 -3600 # Node ID a1dc5732635682654ea97509e94262239e3dbc27 # Parent c0d9e6548b08ef493ee726ec8ae65a2325176479 update diff -r c0d9e6548b08 -r a1dc57326356 solutions5/bf.scala --- a/solutions5/bf.scala Tue Aug 25 01:18:17 2020 +0100 +++ b/solutions5/bf.scala Tue Aug 25 01:41:56 2020 +0100 @@ -1,20 +1,22 @@ -// Part 1 about an Interpreter for the Brainf***++ language -//======================================================== - +// Core Part about an Interpreter for +// the Brainf***++ language +//============================================== object CW10a { -import io.Source -import scala.util._ +// representation of Bf memory type Mem = Map[Int, Int] // (1) Write a function that takes a file name as argument and -// and requests the corresponding file from disk. It returns the +// and requests the corresponding file from disk. It Returns the // content of the file as a String. If the file does not exists, -// the function should return the empty string. +// the function should Return the empty string. + +import io.Source +import scala.util._ def load_bff(name: String) : String = Try(Source.fromFile(name)("ISO-8859-1").mkString).getOrElse("") @@ -82,6 +84,7 @@ // rules of the brainf***++ language. Then, recursively, the compute // function continues with the command at the new program // counter. +// // Implement the run function that calls compute with the program // counter and memory counter set to 0. diff -r c0d9e6548b08 -r a1dc57326356 templates5/bf.scala --- a/templates5/bf.scala Tue Aug 25 01:18:17 2020 +0100 +++ b/templates5/bf.scala Tue Aug 25 01:41:56 2020 +0100 @@ -1,5 +1,5 @@ // Core Part about an Interpreter for -// the Brainf*** language +// the Brainf***++ language //============================================== @@ -24,7 +24,7 @@ // (2) Complete the functions for safely reading -// and writing brainf*** memory. Safely read should +// and writing brainf***++ memory. Safely read should // Return the value stored in the Map for a given memory // pointer, provided it exists; otherwise it Returns 0. The // writing function generates a new Map with the @@ -39,7 +39,7 @@ // (3) Implement the two jumping instructions in the -// brainf*** language. In jumpRight, given a program and +// brainf***++ language. In jumpRight, given a program and // a program counter move the program counter to the right // until after the *matching* ]-command. Similarly, // jumpLeft implements the move to the left to just after @@ -60,15 +60,15 @@ -// (4) Complete the compute function that interprets (runs) a brainf*** +// (4) Complete the compute function that interprets (runs) a brainf***++ // program: the arguments are a program (represented as a string), a program -// counter, a memory counter and a brainf*** memory. It Returns the -// memory at the stage when the execution of the brainf*** program +// counter, a memory counter and a brainf***++ memory. It Returns the +// memory at the stage when the execution of the brainf***++ program // finishes. The interpretation finishes once the program counter // pc is pointing to something outside the program string. // If the pc points to a character inside the program, the pc, // memory pointer and memory need to be updated according to -// rules of the brainf*** language. Then, recursively, the compute +// rules of the brainf***++ language. Then, recursively, the compute // function continues with the command at the new program // counter. // @@ -81,119 +81,108 @@ //def run(prog: String, m: Mem = Map()) = ... -/* -// some sample bf-programs collected from the Internet -//===================================================== +// some sample bf/bf++-programs collected from the Internet +//========================================================== -// first some contrived (small) programs +// some contrived (small) programs +//--------------------------------- // clears the 0-cell -run("[-]", Map(0 -> 100)) // Map will be 0 -> 0 +//run("[-]", Map(0 -> 100)) // Map will be 0 -> 0 -// copies content of the 0-cell to 1-cell -run("[->+<]", Map(0 -> 10)) // Map will be 0 -> 0, 1 -> 10 +// moves content of the 0-cell to 1-cell +//run("[->+<]", Map(0 -> 10)) // Map will be 0 -> 0, 1 -> 10 // copies content of the 0-cell to 2-cell and 4-cell -run("[>>+>>+<<<<-]", Map(0 -> 42)) +//run("[>>+>>+<<<<-]", Map(0 -> 42)) // Map(0 -> 0, 2 -> 42, 4 -> 42) // prints out numbers 0 to 9 -run("""+++++[->++++++++++<]>--<+++[->>++++++++++<<]>>++<<----------[+>.>.<+<]""") +//run("""+++++[->++++++++++<]>--<+++[->>++++++++++<<]>>++<<----------[+>.>.<+<]""") + +// bf++ program calculating the cube-function, 10 * 10 * 10 = 1000 +//run("""++++++++++#>+***#""") // Map(0 -> 10, 1 -> 1000) + + +// bf++ program copies 3 from 0-cell to to cells 1, 4, 5, 6 and 7 +// (note that because of how the program wprks cell 1 will contain 7) +//run("""+++>+@+@+@+@+@""") // Map(0 -> 3, 1 -> 7, 4 -> 3, 5 -> 3, 6 -> 3, 7 -> 3) + // some more "useful" programs +//----------------------------- // hello world program 1 -run("""++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++ - ..+++.>>.<-.<.+++.------.--------.>>+.>++.""") +//run("""++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++ +// ..+++.>>.<-.<.+++.------.--------.>>+.>++.""") // hello world program 2 -run("""++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>+ - +.<<+++++++++++++++.>.+++.------.--------.>+.>.""") +//run("""++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>+ +// +.<<+++++++++++++++.>.+++.------.--------.>+.>.""") +// hello world program 3 +//run("""+++++++++[>++++++++>+++++++++++>+++++<<<-]>.>++.+++++++.. +// +++.>-.------------.<++++++++.--------.+++.------.--------.>+.""") + // draws the Sierpinski triangle -run("""++++++++[>+>++++<<-]>++>>+<[-[>>+<<-]+>>]>+[-<<<[ - ->[+[-]+>++>>>-<<]<[<]>>++++++[<<+++++>>-]+<<++.[-]<< - ]>.>+[>>]>+]""") - -run(load_bff("sierpinski.bf")) +//run(load_bff("sierpinski.bf")) //fibonacci numbers below 100 -run("""+++++++++++ - >+>>>>++++++++++++++++++++++++++++++++++++++++++++ - >++++++++++++++++++++++++++++++++<<<<<<[>[>>>>>>+> - +<<<<<<<-]>>>>>>>[<<<<<<<+>>>>>>>-]<[>++++++++++[- - <-[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]]>[<<[>>>+<<< - -]>>[-]]<<]>>>[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]] - >[<<+>>[-]]<<<<<<<]>>>>>[+++++++++++++++++++++++++ - +++++++++++++++++++++++.[-]]++++++++++<[->-<]>++++ - ++++++++++++++++++++++++++++++++++++++++++++.[-]<< - <<<<<<<<<<[>>>+>+<<<<-]>>>>[<<<<+>>>>-]<-[>>.>.<<< - [-]]<<[>>+>+<<<-]>>>[<<<+>>>-]<<[<+>-]>[<+>-]<<<-]""") - +//run("""+++++++++++ +// >+>>>>++++++++++++++++++++++++++++++++++++++++++++ +// >++++++++++++++++++++++++++++++++<<<<<<[>[>>>>>>+> +// +<<<<<<<-]>>>>>>>[<<<<<<<+>>>>>>>-]<[>++++++++++[- +// <-[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]]>[<<[>>>+<<< +// -]>>[-]]<<]>>>[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]] +// >[<<+>>[-]]<<<<<<<]>>>>>[+++++++++++++++++++++++++ +// +++++++++++++++++++++++.[-]]++++++++++<[->-<]>++++ +// ++++++++++++++++++++++++++++++++++++++++++++.[-]<< +// <<<<<<<<<<[>>>+>+<<<<-]>>>>[<<<<+>>>>-]<-[>>.>.<<< +// [-]]<<[>>+>+<<<-]>>>[<<<+>>>-]<<[<+>-]>[<+>-]<<<-]""") //outputs the square numbers up to 10000 -run("""++++[>+++++<-]>[<+++++>-]+<+[ - >[>+>+<<-]++>>[<<+>>-]>>>[-]++>[-]+ - >>>+[[-]++++++>>>]<<<[[<++++++++<++>>-]+<.<[>----<-]<] - <<[>>>>>[>>>[-]+++++++++<[>-<-]+++++++++>[-[<->-]+[<<<]]<[>+<-]>]<<-]<<-]""") - -//collatz numbers (needs a number to be typed in) -run(""">,[[----------[ - >>>[>>>>]+[[-]+<[->>>>++>>>>+[>>>>]++[->+<<<<<]]<<<] - ++++++[>------<-]>--[>>[->>>>]+>+[<<<<]>-],<]>]>>>++>+>>[ - <<[>>>>[-]+++++++++<[>-<-]+++++++++>[-[<->-]+[<<<<]]<[>+<-]>] - >[>[>>>>]+[[-]<[+[->>>>]>+<]>[<+>[<<<<]]+<<<<]>>>[->>>>]+>+[<<<<]] - >[[>+>>[<<<<+>>>>-]>]<<<<[-]>[-<<<<]]>>>>>>> - ]>>+[[-]++++++>>>>]<<<<[[<++++++++>-]<.[-]<[-]<[-]<]<,]""") +//run("""++++[>+++++<-]>[<+++++>-]+<+[>[>+>+<<-]++>>[<<+>>-]>>>[-]++>[-]+ +// >>>+[[-]++++++>>>]<<<[[<++++++++<++>>-]+<.<[>----<-]<] +// <<[>>>>>[>>>[-]+++++++++<[>-<-]+++++++++>[-[<->-]+[<<<]]<[>+<-]>]<<-]<<-]""") -// infinite collatz (never stops) -run(""">>+>+<[[->>[>>]>>>[>>]+[<<]<<<[<<]>[>[>>]>>+>[>>]<+<[<<]<<<[< - <]>-]>[>>]>>[<<<<[<<]>+>[>>]>>-]<<<<[<<]+>>]<<[+++++[>+++++++ - +<-]>.<++++++[>--------<-]+<<]>>[>>]+[>>>>[<<+>+>-]<-[>+<-]+< - [<<->>-[<<+>>[-]]]>>>[<<<+<<+>>>>>-]<<<[>>>+<<<-]<<[[-]>+>>-> - [<+<[<<+>>-]<[>+<-]<[>+<-]>>>>-]<[>+<-]+<[->[>>]<<[->[<+++>-[ - <+++>-[<+++>-[<[-]++>>[-]+>+<<-[<+++>-[<+++>-[<[-]+>>>+<<-[<+ - ++>-[<+++>-]]]]]]]]]<[>+<-]+<<]>>>+<[->[<+>-[<+>-[<+>-[<+>-[< - +>-[<+>-[<+>-[<+>-[<+>-[<[-]>>[-]+>+<<-[<+>-]]]]]]]]]]]<[>+<- - ]+>>]<<[<<]>]<[->>[->+>]<[-[<+>-[<->>+<-[<+>-[<->>+<-[<+>-[<- - >>+<-[<+>-[<->>+<-[<+>-[<->>+<-[<+>-[<->>+<-[<+>-[<->>+<-[<+> - -[<->>+<-[<+>-[<->>+<-[<+>-]]]]]]]]]]]]]]]]]]]>[<+>-]<+<[<+++ - +++++++>-]<]>>[<+>->>]<<[>+>+<<-]>[<+>-]+>[<->[-]]<[-<<-]<<[< - <]]++++++[>+++++++<-]>++.------------.[-]>[>>]<<[+++++[>+++++ - +++<-]>.<++++++[>--------<-]+<<]+<]>[<+>-]<]>>>[>>]<<[>[-]<-< - <]++++++++++.[-]<<<[<<]>>>+<[->[<+>-[<+>-[<+>-[<+>-[<+>-[<+>- - [<+>-[<+>-[<+>-[<[-]>>[-]+>+<<-]]]]]]]]]]<[>+<-]+>>]<<[<<]>>]""") +// calculates 2 to the power of 6 +//(example from a C-to-BF compiler at https://github.com/elikaski/BF-it) +//run(""">>[-]>[-]++>[-]++++++><<<>>>>[-]+><>[-]<<[-]>[>+<<+>-]>[<+>-] +// <><[-]>[-]<<<[>>+>+<<<-]>>>[<<<+>>>-][-]><<>>[-]>[-]<<<[>>[-] +// <[>+>+<<-]>[<+>-]+>[[-]<-<->>]<<<-]>>[<<+>>-]<<[[-]>[-]<<[>+> +// +<<-]>>[<<+>>-][-]>[-]<<<<<[>>>>+>+<<<<<-]>>>>>[<<<<<+>>>>>-] +// <<>>[-]>[-]<<<[>>>+<<<-]>>>[<<[<+>>+<-]>[<+>-]>-]<<<>[-]<<[-] +// >[>+<<+>-]>[<+>-]<><[-]>[-]<<<[>>+>+<<<-]>>>-[<<<+>>>-]<[-]>[-] +// <<<[>>+>+<<<-]>>>[<<<+>>>-][-]><<>>[-]>[-]<<<[>>[-]<[>+>+<<-]> +// [<+>-]+>[[-]<-<->>]<<<-]>>[<<+>>-]<<][-]>[-]<<[>+>+<<-]>>[<<+> +// >-]<<<<<[-]>>>>[<<<<+>>>>-]<<<<><>[-]<<[-]>[>+<<+>-]>[<+>-]<> +// <[-]>[-]>[-]<<<[>>+>+<<<-]>>>[<<<+>>>-]<<>>[-]>[-]>[-]>[-]>[-]> +// [-]>[-]>[-]>[-]>[-]<<<<<<<<<<>>++++++++++<<[->+>-[>+>>]>[+[-<+ +// >]>+>>]<<<<<<]>>[-]>>>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<< +// ]>[-]>>[>++++++[-<++++++++>]<.<<+>+>[-]]<[<[->-<]++++++[->++++ +// ++++<]>.[-]]<<++++++[-<++++++++>]<.[-]<<[-<+>]<<><<<""") // a Mandelbrot set generator in brainf*** written by Erik Bosman // (http://esoteric.sange.fi/brainfuck/utils/mandelbrot/) - -run(load_bff("mandelbrot.bf")) +// +//run(load_bff("mandelbrot.bf")) // a benchmark program (counts down from 'Z' to 'A') -val b1 = """>++[<+++++++++++++>-]<[[>+>+<<-]>[<+>-]++++++++ - [>++++++++<-]>.[-]<<>++++++++++[>++++++++++[>++ - ++++++++[>++++++++++[>++++++++++[>++++++++++[>+ - +++++++++[-]<-]<-]<-]<-]<-]<-]<-]++++++++++.""" - +// +//run(load_bff("benchmark.bf")) -def time_needed[T](n: Int, code: => T) = { - val start = System.nanoTime() - for (i <- 0 until n) code - val end = System.nanoTime() - (end - start)/(n * 1.0e9) -} - -time_needed(1, run(b1)) -*/ +// calculates the Collatz series for numbers from 1 to 30 +// +//run(load_bff("collatz.bf")) } diff -r c0d9e6548b08 -r a1dc57326356 templates5/mandelbrot.bf --- a/templates5/mandelbrot.bf Tue Aug 25 01:18:17 2020 +0100 +++ b/templates5/mandelbrot.bf Tue Aug 25 01:41:56 2020 +0100 @@ -1,4 +1,7 @@ - A mandelbrot set fractal viewer in brainf*** written by Erik Bosman +// a Mandelbrot set generator in brainf___ written by Erik Bosman +// (http://esoteric.sange.fi/brainfuck/utils/mandelbrot/) + + +++++++++++++[->++>>>+++++>++>+<<<<<<]>>>>>++++++>--->>>>>>>>>>+++++++++++++++[[ >>>>>>>>>]+[<<<<<<<<<]>>>>>>>>>-]+[>>>>>>>>[-]>]<<<<<<<<<[<<<<<<<<<]>>>>>>>>[-]+ <<<<<<<+++++[-[->>>>>>>>>+<<<<<<<<<]>>>>>>>>>]>>>>>>>+>>>>>>>>>>>>>>>>>>>>>>>>>>