Email or username:

Password:

Forgot your password?
All posts Devine Lu Linvega's posts Post Back to profile
Top-level
bx

@neauoire ive been doing allot of wierd C preprocessor usage lately and reading gur page for modal, its wild to see a system that is so similar yet so much nicer and more flexible (gur way paren matching works / getting around it is a large bit of my cpp efforts rn), really curious how much would need to be done to add hex/binary escapes to modal to allow it to do unmatched parens + potentially allow it to operate on binary data (a dissassembler in modal would be REALLY cool)

14 April at 17:55 | Wall-to-wall | Open on tiny.tilde.website
3 comments
Devine Lu Linvega

@bx that should be fairly small a change to add, you could add to the escape code so it can handle 0x28 and 0x29: git.sr.ht/~rabbits/modal/tree/

14 April at 17:59 | Open on merveilles.town
bx

@neauoire i was thinking more at a higher level to allow it to work in rules as well, itd be really fun to match against an op code name and ouput gur binary for it in a sequence along side its length in bytes, then have a higher level pattern that takes instruction sequences and converts labels into addresses to make a function.
or rules that move parens around without them matching, like if you wanted to write a program to transform "do"/"end" into "("/")"

14 April at 19:01 | Open on tiny.tilde.website
Devine Lu Linvega

@bx Oh, you can already do this transformation with the ?* register :), I have a couple of string rules if you need a hand with that bit. Hop on irc or discord if you can.

14 April at 19:26 | Open on merveilles.town
Go Up