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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
|
{:NomsuCode} = require "code_obj"
{:find, :sub, :match} = string
{:R,:P,:S} = require 'lpeg'
re = require 're'
MAX_LINE = 80
GOLDEN_RATIO = ((math.sqrt(5)-1)/2)
-- Parsing helper functions
utf8_char_patt = (
R("\194\223")*R("\128\191") +
R("\224\239")*R("\128\191")*R("\128\191") +
R("\240\244")*R("\128\191")*R("\128\191")*R("\128\191"))
operator_patt = S("'`~!@%#^&*+=|<>?/-")^1 * -1
identifier_patt = (R("az","AZ","09") + P("_") + utf8_char_patt)^1 * -1
is_operator = (s)->
return not not operator_patt\match(s)
is_identifier = (s)->
return not not identifier_patt\match(s)
inline_escaper = re.compile("{~ (%utf8_char / ('\"' -> '\\\"') / ('\n' -> '\\n') / ('\t' -> '\\t') / ('\b' -> '\\b') / ('\a' -> '\\a') / ('\v' -> '\\v') / ('\f' -> '\\f') / ('\r' -> '\\r') / ('\\' -> '\\\\') / ([^ -~] -> escape) / .)* ~}", {utf8_char: utf8_char_patt, escape:(=> ("\\%03d")\format(@byte!))})
inline_escape = (s)->
return inline_escaper\match(s)
escaper = re.compile("{~ (%utf8_char / ('\\' -> '\\\\') / [\n\r\t -~] / (. -> escape))* ~}",
{utf8_char: utf8_char_patt, escape:(=> ("\\%03d")\format(@byte!))})
escape = (s)->
return escaper\match(s)
tree_to_inline_nomsu = (tree)->
switch tree.type
when "Action"
nomsu = NomsuCode\from(tree.source)
num_args = 0
for i,bit in ipairs tree
if type(bit) == "string"
clump_words = if type(tree[i-1]) == 'string'
is_operator(bit) != is_operator(tree[i-1])
else bit == "'"
nomsu\add " " if i > 1 and not clump_words
nomsu\add bit
else
num_args += 1
arg_nomsu = tree_to_inline_nomsu(bit)
if bit.type == "Block"
if i > 1 and i < #tree
nomsu\add " "
unless i == #tree
arg_nomsu\parenthesize!
else
nomsu\add " " if i > 1 and tree[i-1] != "#"
if bit.type == "Action" or bit.type == "MethodCall"
arg_nomsu\parenthesize!
nomsu\add arg_nomsu
return nomsu
when "MethodCall"
target_nomsu = tree_to_inline_nomsu(tree[1])
if tree[1].type == "Block"
target_nomsu\parenthesize!
nomsu = NomsuCode\from(tree.source, target_nomsu, ", ")
for i=2,#tree
nomsu\add "; " if i > 2
nomsu\add tree_to_inline_nomsu(tree[i])
return nomsu
when "EscapedNomsu"
inner_nomsu = tree_to_inline_nomsu(tree[1])
unless tree[1].type == "List" or tree[1].type == "Dict" or tree[1].type == "Var"
inner_nomsu\parenthesize!
return NomsuCode\from(tree.source, "\\", inner_nomsu)
when "Block"
nomsu = NomsuCode\from(tree.source, ":")
for i,line in ipairs tree
nomsu\add(i == 1 and " " or "; ")
nomsu\add tree_to_inline_nomsu(line)
nomsu\parenthesize! if #tree > 1
return nomsu
when "Text"
add_text = (nomsu, tree)->
for i, bit in ipairs tree
if type(bit) == 'string'
escaped = inline_escape(bit)
nomsu\add inline_escape(bit)
elseif bit.type == "Text"
add_text(nomsu, bit)
else
interp_nomsu = tree_to_inline_nomsu(bit)
if bit.type != "Var" and bit.type != "List" and bit.type != "Dict"
interp_nomsu\parenthesize!
elseif bit.type == "Var" and type(tree[i+1]) == 'string' and not match(tree[i+1], "^[ \n\t,.:;#(){}[%]]")
interp_nomsu\parenthesize!
nomsu\add "\\", interp_nomsu
nomsu = NomsuCode\from(tree.source)
add_text(nomsu, tree)
return NomsuCode\from(tree.source, '"', nomsu, '"')
when "List", "Dict"
nomsu = NomsuCode\from(tree.source, (tree.type == "List" and "[" or "{"))
for i, item in ipairs tree
nomsu\add ", " if i > 1
item_nomsu = tree_to_inline_nomsu(item, true)
--if item.type == "Block" or item.type == "Action" or item.type == "MethodCall"
-- item_nomsu\parenthesize!
if item.type == "MethodCall"
item_nomsu\parenthesize!
nomsu\add item_nomsu
nomsu\add(tree.type == "List" and "]" or "}")
return nomsu
when "DictEntry"
key, value = tree[1], tree[2]
nomsu = NomsuCode\from(tree.source)
-- TODO: remove shim
if key.type != "Index"
key = {type:"Index", source:key.source, key}
nomsu\add tree_to_inline_nomsu(key)
if value
nomsu\add " = "
value_nomsu = tree_to_inline_nomsu(value)
value_nomsu\parenthesize! if value.type == "Block" or value.type == "Action" or value.type == "MethodCall"
nomsu\add value_nomsu
return nomsu
when "Index"
key = tree[1]
nomsu = NomsuCode\from(key.source, ".")
key_nomsu = if key.type == "Text" and #key == 1 and is_identifier(key[1])
key[1]
else
tree_to_inline_nomsu(key)
key_nomsu\parenthesize! if key.type == "Block" or key.type == "Action" or key.type == "MethodCall"
return NomsuCode\from(key.source, ".", key_nomsu)
when "IndexChain"
nomsu = NomsuCode\from(tree.source)
for i, bit in ipairs tree
nomsu\add "." if i > 1 and bit.type != "Index"
local bit_nomsu
bit_nomsu = if i > 1 and bit.type == "Text" and #bit == 1 and type(bit[1]) == 'string' and is_identifier(bit[1])
bit[1]
else tree_to_inline_nomsu(bit)
assert bit.type != "Block"
switch bit.type
when "Action", "MethodCall", "IndexChain"
bit_nomsu\parenthesize!
when "Number"
bit_nomsu\parenthesize! if bit_nomsu\text!\match("%.")
nomsu\add bit_nomsu
return nomsu
when "Number"
s = if tree.hex and tree[1] < 0
("-0x%X")\format(-tree[1])
elseif tree.hex
("0x%X")\format(tree[1])
else tostring(tree[1])
return NomsuCode\from(tree.source, s)
when "Var"
varname = tree[1]
if varname == "" or is_identifier(varname)
return NomsuCode\from(tree.source, "$", varname)
else
return NomsuCode\from(tree.source, "$(", varname, ")")
when "FileChunks"
error("Can't inline a FileChunks")
when "Comment"
-- TODO: implement?
return NomsuCode\from(tree.source)
when "Error"
error("Can't compile errors")
else
error("Unknown type: #{tree.type}")
tree_to_nomsu = (tree)->
nomsu = NomsuCode\from(tree.source)
-- For concision:
recurse = (t, argnum=nil)->
space = MAX_LINE - nomsu\trailing_line_len!
try_inline = true
for subtree in coroutine.wrap(-> (t\map(coroutine.yield) and nil))
if subtree.type == "Comment"
try_inline = false
if subtree.type == "Block"
if #subtree > 1
try_inline = false
local inline_nomsu
if try_inline
inline_nomsu = tree_to_inline_nomsu(t)
if #inline_nomsu\text! <= space or #inline_nomsu\text! <= 8
if (t.type == "Action" or t.type == "MethodCall")
inline_nomsu\parenthesize!
if t.type != "Text"
return inline_nomsu
indented = tree_to_nomsu(t)
if t.type == "Action" or t.type == "MethodCall"
if indented\is_multiline!
if argnum == nil or argnum == 1
return NomsuCode\from(t.source, "(\n ", indented, "\n)")
else
return NomsuCode\from(t.source, "\n ", indented)
elseif argnum and argnum > 1
return NomsuCode\from(t.source, "\n ", indented)
else
indented\parenthesize!
indented_lines = [line for line in *indented\text!\lines! when line\match("%S")]
if inline_nomsu and #indented_lines == ((t.type == 'Block' or t.type == 'Action' or t.type == 'MethodCall') and 2 or 3) and nomsu\trailing_line_len! <= 8
return inline_nomsu
elseif inline_nomsu and t.type == "Text" and #indented_lines <= 3 and
(#inline_nomsu\text! - 2 < MAX_LINE + 4 or #inline_nomsu\text! <= space or #inline_nomsu\text! <= 8)
return inline_nomsu
return indented
switch tree.type
when "FileChunks"
if tree.shebang
nomsu\add tree.shebang
for chunk_no, chunk in ipairs tree
nomsu\add "\n\n#{("~")\rep(80)}\n\n" if chunk_no > 1
if chunk.type == "Block"
nomsu\add NomsuCode\from(chunk.source, table.unpack(tree_to_nomsu(chunk).bits, 2))
else
nomsu\add tree_to_nomsu(chunk)
nomsu\add('\n') unless nomsu\match("\n$")
return nomsu
when "Action"
next_space = ""
word_buffer = {}
num_args = 0
for i,bit in ipairs tree
-- TODO: properly wrap super long chains of words
if type(bit) == "string"
if #word_buffer > 0 and is_operator(bit) == is_operator(word_buffer[#word_buffer])
table.insert word_buffer, " "
table.insert word_buffer, bit
continue
if #word_buffer > 0
words = table.concat(word_buffer)
if next_space == " "
if nomsu\trailing_line_len! + #words > MAX_LINE and nomsu\trailing_line_len! > 8
next_space = "\n.."
elseif word_buffer[1] == "'"
next_space = ""
nomsu\add next_space, words
word_buffer = {}
next_space = " "
num_args += 1
bit_nomsu = recurse(bit, i)
if bit.type == "Block"
-- Rule of thumb: nontrivial one-liner block arguments should be no more
-- than golden ratio * the length of the proceeding part of the line
if not bit_nomsu\is_multiline! and #bit_nomsu\text! > nomsu\trailing_line_len! * GOLDEN_RATIO and #bit_nomsu\text! > 8
bit_nomsu = tree_to_nomsu(bit)
elseif (not bit_nomsu\is_multiline! and
nomsu\trailing_line_len! + #bit_nomsu\text! > MAX_LINE and
nomsu\trailing_line_len! > 8)
if next_space == " " and #bit_nomsu\text! < MAX_LINE
next_space = "\n.."
elseif bit.type == 'Action' or bit.type == "MethodCall"
bit_nomsu = NomsuCode\from bit.source, "\n ", tree_to_nomsu(bit)
else
bit_nomsu = tree_to_nomsu(bit)
unless next_space == " " and bit_nomsu\text!\match("^[:\n]")
nomsu\add next_space
nomsu\add bit_nomsu
next_space = (bit.type == 'Block' or (i > 1 and (bit.type == 'Action' or bit.type == 'MethodCall')) and bit_nomsu\is_multiline!) and "\n.." or " "
if #word_buffer > 0
words = table.concat(word_buffer)
if next_space == " "
if nomsu\trailing_line_len! + #words > MAX_LINE and nomsu\trailing_line_len! > 8
next_space = "\n.."
elseif word_buffer[1] == "'"
next_space = ""
nomsu\add next_space, words
next_space = " "
return nomsu
when "MethodCall"
target_nomsu = recurse(tree[1])
if tree[1].type == "Block" and not target_nomsu\is_multiline!
target_nomsu\parenthesize!
nomsu\add target_nomsu, ", "
inner_nomsu = NomsuCode!
for i=2,#tree
inner_nomsu\add "\n" if i > 2
inner_nomsu\add tree_to_nomsu(tree[i])
if #tree == 2 and nomsu\trailing_line_len! + #inner_nomsu\text!\match("^[^\n]*") < MAX_LINE
nomsu\add inner_nomsu
else
nomsu\add "\n ", inner_nomsu
return nomsu
when "EscapedNomsu"
nomsu = recurse(tree[1])
if tree[1].type == 'Block' and not nomsu\is_multiline!
nomsu\parenthesize!
return NomsuCode\from tree.source, "\\", nomsu
when "Block"
prev_line, needs_space = nil, {}
for i, line in ipairs tree
line_nomsu = tree_to_nomsu(line)
if i > 1
nomsu\add "\n"
-- Rule of thumb: add a blank line between two lines if both are
-- multi-line non-comments, or if a comment comes after a non-comment,
-- or if the last line starts with ".."
if tree[i-1].type != "Comment"
needs_space[i] = ((line_nomsu\is_multiline! and prev_line\is_multiline!) or
prev_line\text!\match("%.%.[^\n]*$"))
if tree[i].type == "Comment" or needs_space[i] or needs_space[i-1]
nomsu\add "\n"
nomsu\add line_nomsu
prev_line = line_nomsu
return NomsuCode\from(tree.source, ":\n ", nomsu)
when "Text"
-- Multi-line text has more generous wrap margins
max_line = MAX_LINE + 8
add_text = (tree)->
for i, bit in ipairs tree
if type(bit) == 'string'
bit = escape(bit)
for j, line in ipairs bit\lines!
if j > 1
if nomsu\text!\match(" $")
nomsu\add "\\;"
nomsu\add "\n"
elseif #line > 10 and nomsu\trailing_line_len! > max_line
nomsu\add "\\\n.."
while #line > 0
space = max_line - nomsu\trailing_line_len!
split = find(line, "[%p%s]", space)
if not split or split > space + 10
split = space + 10
if #line - split < 10
split = #line
bite, line = sub(line, 1, split), sub(line, split+1, -1)
nomsu\add bite
nomsu\add "\\\n.." if #line > 0
elseif bit.type == "Text"
add_text(bit)
else
nomsu\add "\\"
interp_nomsu = recurse(bit)
unless interp_nomsu\is_multiline!
if bit.type == "Var"
next_str = tree[i+1]
while type(next_str) == 'table' and next_str.type == 'Text'
next_str = next_str[1]
if type(next_str) == 'string' and not match(next_str, "^[ \n\t,.:;#(){}[%]]")
interp_nomsu\parenthesize!
elseif bit.type == "EscapedNomsu" or bit.type == "Block" or bit.type == "IndexChain"
interp_nomsu\parenthesize!
nomsu\add interp_nomsu
if interp_nomsu\is_multiline! and bit.type == "Block"
nomsu\add "\n.."
add_text(tree)
if nomsu\text!\match(" $")
nomsu\add "\\;"
return NomsuCode\from(tree.source, '("\n ', nomsu, '\n")')
when "List", "Dict"
if #tree == 0
nomsu\add(tree.type == "List" and "[]" or "{}")
return nomsu
sep = ''
for i, item in ipairs tree
local item_nomsu
if item.type == 'MethodCall'
item_nomsu = recurse(item)
elseif item.type == 'Comment'
item_nomsu = tree_to_nomsu(item)
sep = '\n' if i > 1
else
item_nomsu = tree_to_inline_nomsu(item)
if #item_nomsu\text! > MAX_LINE
item_nomsu = recurse(item)
nomsu\add sep
nomsu\add item_nomsu
if item_nomsu\is_multiline! or item.type == 'Comment' or nomsu\trailing_line_len! + #tostring(item_nomsu) >= MAX_LINE
sep = '\n'
else
sep = ', '
return if tree.type == "List" then
NomsuCode\from(tree.source, "[\n ", nomsu, "\n]")
else
NomsuCode\from(tree.source, "{\n ", nomsu, "\n}")
when "DictEntry"
key, value = tree[1], tree[2]
nomsu = NomsuCode\from(tree.source)
-- TODO: remove shim
if key.type != "Index"
key = {type:"Index", source:key.source, key}
nomsu\add tree_to_nomsu(key)
if value
value_nomsu = recurse(value)
nomsu\add " = ", value_nomsu
return nomsu
when "Comment"
nomsu\add "#", (tree[1]\gsub("\n", "\n "))
return nomsu
when "IndexChain", "Index", "Number", "Var", "Comment", "Error"
return tree_to_inline_nomsu tree
else
error("Unknown type: #{tree.type}")
return {:tree_to_nomsu, :tree_to_inline_nomsu}
|