These are chat archives for liam4/tlnccuwagnf
64 bytes from @arinerron (127.0.0.1): icmp_seq=1 ttl=64 time=0.051 ms
64 bytes from @arinerron (127.0.0.1): icmp_seq=2 ttl=64 time=0.055 ms
nearleyc'd manually once :P
Is the recursive join thing the only way to match more than one of something in nearley?
Looking back on that code it just flattens out a list of lists (each list having the form
[data, list] or
[1, [2, [3, [4, ]]] ->
[1, 2, 3, 4, 5]
So you can't escape string characters, right?
Nope, not yet! :P
Like Microsoft Flow except as an API
googles microsoft flow
// This code is automatically generated. Changes will be overwritten. /* doesn't actually get overwritten */ /* such defeats the purpose of dist */
nearleyc grammar.neis giving me an error about not being able to parse '"'
Shouldn't unevaluated be a keyword?
nearley debugging is hard :(
Yes, yes, yes.
@liam4 don't implement this; I wanna try, k? :P
Good luck! It's a great feature.