#!/usr/bin/env python3
# Copyright (c) 2021-2024 Chris Pressey, Cat's Eye Technologies
# This file is distributed under the MIT license. For more information, see
# the file LicenseRef-MIT-X-Dissociated-Parse.txt in the LICENSES directory.
# SPDX-License-Identifier: LicenseRef-MIT-X-Dissociated-Parse
import json
import os
import re
import sys
import random
def render_sentence(f, productions):
done = False
while not done:
tree = random.choice(productions['S'])
segments = []
render_r(segments, productions, tree)
# favour longer sentences by rejecting short ones often
if len(segments) >= 6:
done = True
elif len(segments) == 5 and random.randint(1, 2) == 1:
done = True
elif len(segments) == 4 and random.randint(1, 4) == 1:
done = True
elif len(segments) == 3 and random.randint(1, 8) == 1:
done = True
elif len(segments) == 2 and random.randint(1, 16) == 1:
done = True
segments[0] = segments[0].title()
f.write(' '.join(segments))
f.write('.\n\n')
def render_r(segments, productions, tree):
if isinstance(tree, str):
segments.append(tree)
elif isinstance(tree, list):
# key each tree by its part of speech plus the first word (only) of its content.
words = []
for child in tree:
if isinstance(child, str):
words.append(child)
key = '-'.join(words[:2])
# HERE ARE THE KEYS TO
# ENTER INTO MU-MU
# FAR FROM THE TRIBES OF THE JAMS:
tree = random.choice(productions[key])
for child in tree[1:]:
render_r(segments, productions, child)
def main():
title = sys.argv[1]
map = {}
with open('data/productions.json', 'r') as f:
productions = json.loads(f.read())
sys.stdout.write('# {}\n\n'.format(title))
for c in range(1, 30):
sys.stdout.write('## Chapter {}\n\n'.format(c))
for i in range(100):
render_sentence(sys.stdout, productions)
main()