This document has moved to the MARYSUE repository:
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
BUT HENCE ----- you'll need | |
++++ you'll say ----- | |
---- SO HENCE they'll have | |
+++++ --- + | |
--- i'll have + | |
AND THEN +++ ++++ | |
----- ++ ---- | |
- BUT NOW AND NOW | |
++ - -- | |
++ ---- SO NOW |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# prelude | |
a = """# prelude""" | |
b = """# remainder | |
print a | |
print 'a = ""' + '"' + a + '""' + '"' | |
print 'b = ""' + '"' + b + '""' + '"' | |
print b | |
""" | |
# remainder | |
print a |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
# the contents of this file are in the public domain | |
import os | |
import random | |
import sys | |
def main(args): | |
filename = args[0] |
This document has moved to The Dossier:
This code has moved to the Latcarf distribution.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# | |
# "The Defeat at Procyon V" | |
# Chris Pressey, Cat's Eye Technologies | |
# for NaNoGenMo 2018 | |
# | |
# | |
# General Utility | |
# |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-- implementation of https://esolangs.org/wiki/An_Odd_Rewriting_System | |
-- I, Chris Pressey, hereby place this source code into the public domain. | |
import Data.Char | |
-- A program in An Odd Rewriting System consists an alphabet of symbols, | |
-- each of which belongs to one of two categories (an odd symbol or an even symbol), | |
-- except for a special halt symbol that appears in neither category; | |
-- two definitions for each symbol (an odd definition and an even definition); | |
-- and an initial string. Both the initial string, and each definition, is simply a |
This document has moved to the Wagon distribution.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(define reduce | |
(lambda (subject complete-rules rules generation-id) | |
(if (null? rules) | |
subject | |
(let* ((rule-pair (car rules)) | |
(rest-of-rules (cdr rules)) | |
(pattern (car rule-pair)) | |
(replacements (cdr rule-pair)) | |
(new-gen-id (+ generation-id 1)) | |
(new-subject (apply-rule subject pattern replacements generation-id))) |