# BrainFuck part 10 - RPN calc tool

DPAmar
7,905 views

### Open Source Your Knowledge, Become a Contributor ## Print as ASCII char

Let's now add another print function, named A, that prints ASCII char based on code instead of integer value.

• Print ASCII (code 65)

Note that, like P, this operator will not consume the first stacked value : it will print it but value remains unchanged

## Let's start

• Memory: empty
• Cursor: first cell
• Input: space separated integers and operators

## Process

• Leave an empty space (current number on stack is null)
• While there is a char to read
• subtract 32 and set else flag
• if char is null : it's space
• reset else flag, move to the right
• subtract 5 (total 37), if char is null : it's modulus
• reset else flag, compute A mod B
• subtract 5 (total 42), if char is null : it's multiply
• reset else flag, multiply the 2 operands
• subtract 1 (total 43), if char is null : it's addition
• reset else flag, sum the 2 operands
• subtract 2 (total 45), if char is null : it's subtraction
• reset else flag, subtract the 2 operands
• subtract 2 (total 47), if char is null : it's division
• reset else flag, divide the 2 operands
• subtract 18 (total 65), if char is null : it's ASCII print
• reset else flag, print first operand as char
• subtract 2 (total 67), if char is null : it's copy
• reset else flag, copy first operand
• subtract 1 (total 68), if char is null : it's drop
• reset else flag, drop first operand
• subtract 12 (total 80), if char is null : it's print
• reset else flag, print first operand
• subtract 2 (total 82), if char is null : it's rot
• reset else flag, rotate stack's head
• subtract 1 (total 83), if char is null : it's swap
• reset else flag, swap first 2 operands
• otherwise
• add 35 (to get the digit value)
• add current number 10 times to current digit to get new current number
• loop

## Code

>,[                     leave empty space and read char
let's track our target values here
space 32
modulus 37
multiply 42
subtract 45
divide 47
ascii print 65
copy 67
drop 68
print 80
rot 82
swap 83
digit 48 to 57

>++++[-<-------->]+<  subtract 32
[-----                subtract 5
[-----                subtract 5
[-                    subtract 1
[--                   subtract 2
[--                   subtract 2
[>+++++[-<--->]+<     subtract 18
[--                   subtract 2
[-                    subtract 1
[------------         subtract 12
[--                   subtract 2
[-                    subtract 1
[                     it's a digit
>++++++[-<+++++>]<  add 35 to get digit value (and reset else flag)
<[->++++++++++<]    add current number 10 times to current digit
>[-<+>]             replace current number by current digit
]>[-                  now unwind cases: it's swap
<<<[->+<]           move A to the right
<[->+<]             move B at A initial location
>>[-<<+>>]>         move A where B was initially
]<]>[-                next case: it's rot
<<<[->+<]<[->+<]<[- move A and B and C to the right
>+<]>>>[-<<<+>>>]>    and move A where C was initially
]<]>[-                next case: it's print
<<<[->+>+<<]>[-<+>] copy number (to remain value unchanged after print)
>[>>>>++++++++++<<< print copied value
<[->+>>+>-[<-]<[->>   as a decimal number
+<<<<[->>>+<<<]>]<<   ** part 3 **
]>+[-<+>]>>>[-]>[-<   ** part 4 **
<<<+>>>>]<<<<]<[>++   ** part 5 **
++++[<++++++++>-]<-   ** part 6 **
.[-]<]                ** part 7 **
++++++++++.[-]>     print newline (and reset newline char)
]<]>[-                next case: it's drop
<<<[-]>             remove stack first value
]<]>[-                next case: it's copy
<<<[->+>+<<]        duplicate stack first value
>>[-<<+>>]>         move duplicate back to original location
]<]>[-                next case: it's ASCII print
<<<.>>              Print value as ASCII char
]<]>[-                next case: it's division
<<<[->>>+<<<]<      move 2nd operand
[->+>>+>-[<-]<[->>+ divide
<<<<[->>>+<<<]>]<<]   ** part 2 **
>[-]>>>[-]>[-<<<<   move result
<+>>>>>]<<<           ** part 2**
]<]>[-                next case: it's subtraction
<<<[-<->]>          do the subtraction
]<]>[-                next case : it's add
]<]>[-                next case : it's multiply
<<<[->>+<<]>>[-<<<  do the multiplication
[->+>+<<]>[-<+>]>>    ** part 2 **
]<<<[-]>>[-<<+>>]     ** part 3 **
]<]>[-                next case : it's modulo
<<<[->>>+<<<]<      move 2nd operand
[->+>>+>-[<-]<[->>+ divide
<<<<[->>>+<<<]>]<<]   ** part 2 **
>[-<+>]>>>[-]       move result
>[-]<<<               ** part 2 **
]<]>[-                next case : it's space
>                   move to next stack entry
]                     end of switch/case


## Final state

• Memory: stack of integers
• Cursor: after stack
You can try with input 123 P C 32 A 47 A D A 5 P S A 61 A D A D C R / P D 37 A D % P This will print 123 / 5 = 24%3 (with some extra line breaks...)  