-
Notifications
You must be signed in to change notification settings - Fork 0
/
bf2ig.c
198 lines (183 loc) · 4.84 KB
/
bf2ig.c
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
187
188
189
190
191
192
193
194
195
196
197
198
/*
* Copyright (c) 2017 Martin Decky
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* - The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/** @file
*
* This is Brianfuck to Ichiglyph transpiler. It decodes the Brainfuck
* instructions according the common specification available at
* https://en.wikipedia.org/wiki/Brainfuck and outputs the corresponding
* Ichiglyph instructions.
*
* Note that any characters not representing a Brainfuck instruction
* are silently ignored and dropped.
*
* The Ichiglyph language was inspired by a remark by Josefina Madrova,
* who cleverly noted that using the characters l, I and 1 in identifiers
* is a bad practice.
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <sys/mman.h>
#include <stdint.h>
#include <string.h>
/** Brainfuck/Ichiglyph instructions
*
* These are the eight Brainfuck and Ichilglyph instructions.
* The INST_NOP instruction represets any other program inpu
* that should be simply ignored.
*
*/
typedef enum {
INST_DP_INC,
INST_DP_DEC,
INST_VAL_INC,
INST_VAL_DEC,
INST_VAL_OUTPUT,
INST_VAL_ACCEPT,
INST_JMP_FORWARD,
INST_JMP_BACK,
INST_NOP
} instruction_t;
/** Decode Brainfuck instruction opcode
*
* Decode the Brainfuck instruction opcode. The eight valid
* instruction characters are decoded to the respective
* instructions, any unrecognized characters are interpretted
* as a NOP.
*
* @param opcode Instruction opcode.
*
* @return Decoded instruction.
*
*/
static instruction_t brainfuck_opcode_decode(uint8_t opcode)
{
switch (opcode) {
case '>':
return INST_DP_INC;
case '<':
return INST_DP_DEC;
case '+':
return INST_VAL_INC;
case '-':
return INST_VAL_DEC;
case '.':
return INST_VAL_OUTPUT;
case ',':
return INST_VAL_ACCEPT;
case '[':
return INST_JMP_FORWARD;
case ']':
return INST_JMP_BACK;
default:
return INST_NOP;
}
}
int main(int argc, char *argv[])
{
/*
* The first command-line argument is the Brainfuck
* source file.
*/
if (argc < 2) {
fprintf(stderr, "Syntax: %s <source>\n", argv[0]);
return 1;
}
char *source_name = argv[1];
int source = open(source_name, O_RDONLY);
if (source < 0) {
fprintf(stderr, "%s: Unable to open\n", source_name);
return 2;
}
struct stat stat;
int ret = fstat(source, &stat);
if (ret != 0) {
fprintf(stderr, "%s: Unable to stat\n", source_name);
close(source);
return 3;
}
size_t program_size = stat.st_size;
/*
* We mmap the entire source file.
*/
uint8_t *program = (uint8_t *) mmap(NULL, program_size, PROT_READ,
MAP_PRIVATE, source, 0);
if (program == MAP_FAILED) {
fprintf(stderr, "%s: Unable to mmap\n", source_name);
close(source);
return 4;
}
size_t ip = 0;
while (ip < program_size) {
/*
* Brainfuck instruction fetch and decode.
*/
uint8_t brainfuck_opcode = program[ip];
instruction_t instruction =
brainfuck_opcode_decode(brainfuck_opcode);
/*
* Ichiglyph instruction encode.
*/
switch (instruction) {
case INST_DP_INC:
fputs("ll", stdout);
break;
case INST_DP_DEC:
fputs("lI", stdout);
break;
case INST_VAL_INC:
fputs("Il", stdout);
break;
case INST_VAL_DEC:
fputs("II", stdout);
break;
case INST_VAL_OUTPUT:
fputs("1l", stdout);
break;
case INST_VAL_ACCEPT:
fputs("1I", stdout);
break;
case INST_JMP_FORWARD:
fputs("l1", stdout);
break;
case INST_JMP_BACK:
fputs("I1", stdout);
break;
case INST_NOP:
break;
}
ip++;
}
munmap(program, program_size);
close(source);
return 0;
}