This repository has been archived by the owner on Mar 22, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbrainfuck.go
186 lines (155 loc) · 3.31 KB
/
brainfuck.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
package main
import (
"bufio"
"bytes"
"encoding/binary"
"fmt"
"os"
"strings"
"time"
"github.com/fatih/color"
"github.com/gosuri/uilive"
)
// Brainfuck ...
type Brainfuck struct {
program []string
cells []uint64
cell *uint64
pos int
step int
output string
}
// BrainfuckConstructor will return a Brainfuck struct allowing
// execution of Brainfuck code
func BrainfuckConstructor(program string) (b Brainfuck) {
minified := syntax.ReplaceAllString(string(program), "")
b.program = strings.Split(minified, "")
b.cells = make([]uint64, 1)
b.cell = &b.cells[b.pos]
return
}
// Execute the parsed Brainfuck code.
func (b *Brainfuck) Execute() string {
writer := uilive.New()
writer.Start()
for b.step < len(b.program) {
b.handle(b.program[b.step])
b.cell = &b.cells[b.pos]
fmt.Fprintf(writer, "%s\n%s\n%s\n",
b.PrettyCellState(), b.PrettyProgramState(), b.output)
time.Sleep(time.Millisecond * time.Duration(delay))
}
writer.Stop()
return b.output
}
func (b *Brainfuck) handle(action string) {
switch action {
case ">":
b.incrementPosition()
case "<":
b.decrementPosition()
case "+":
b.incrementCell()
case "-":
b.decrementCell()
case ".":
b.outputValue()
case ",":
b.inputValue()
case "[":
if *b.cell == 0 {
for i := b.step; i < len(b.program); i++ {
if b.program[i] == "]" {
b.step = i + 1
break
}
}
}
case "]":
if *b.cell > 0 {
for i := b.step; i > 0; i-- {
if b.program[i] == "[" {
b.step = i
break
}
}
}
default:
fmt.Printf("'%s' is invalid syntax.", action)
}
b.step = b.step + 1
}
func (b *Brainfuck) incrementPosition() {
b.pos++
if b.pos >= len(b.cells) {
b.cells = append(b.cells, 0)
}
}
func (b *Brainfuck) decrementPosition() {
b.pos--
if b.pos < 0 {
panic("Invalid syntax, negative pointer.")
}
}
func (b *Brainfuck) incrementCell() {
*b.cell++
}
func (b *Brainfuck) decrementCell() {
*b.cell--
}
func (b *Brainfuck) outputValue() {
var buf bytes.Buffer
buf.WriteString(b.output)
buf.WriteString(string(*b.cell))
b.output = buf.String()
}
func (b *Brainfuck) inputValue() {
buf := bufio.NewReader(os.Stdin)
fmt.Print("> ")
input, err := buf.ReadBytes('\n')
if err != nil {
panic(err)
} else {
*b.cell = binary.BigEndian.Uint64(input)
}
}
// PrettyCellState will return a pretty formatted table containing
// all the cell states at the time of calling
func (b Brainfuck) PrettyCellState() string {
var buf bytes.Buffer
red := color.New(color.FgRed).SprintFunc()
for i, cell := range b.cells {
str := strings.TrimSpace(string(cell))
if i == b.pos {
buf.WriteString(red(str))
} else {
buf.WriteString(str)
}
buf.WriteString(strings.Repeat(" ", 8-len(str)))
}
buf.WriteString("\n")
for i, cell := range b.cells {
str := fmt.Sprint(cell)
if i == b.pos {
buf.WriteString(red(str))
} else {
buf.WriteString(str)
}
buf.WriteString(strings.Repeat(" ", 8-len(str)))
}
return buf.String()
}
// PrettyProgramState will return a pretty formatted line of text
// indicating the position in the program
func (b Brainfuck) PrettyProgramState() string {
var buf bytes.Buffer
red := color.New(color.FgRed).SprintFunc()
for i, step := range b.program {
if i == b.step {
buf.WriteString(red(step))
} else {
buf.WriteString(step)
}
}
return buf.String()
}