probcomp/bayeslite

use flat token sequence, not nested lists of strings, for CREATE GENERATOR schema

Open

#395 opened on Apr 19, 2016

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Python (915 stars) (63 forks)batch import
help wantedk dayslanguagemetamodel revision

Description

The nested lists of strings were convenient for simple-minded hand-written parsers, but we want to expand the language of population schemas substantially. This will make it easier to write standard grammars, e.g. with lemonade, for complex languages. We should then rewrite the Crosscat population schema grammar with lemonade.

Contributor guide

Tech stack
python
Domain
backenddatabase
Issue type
refactor
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
4
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
mostly clear
Prerequisites
Python programmingUnderstanding of parser design
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
30
Research direction
Investigate the current nested list representation for token sequences in the CREATE GENERATOR schema. Look at how the Crosscat population schema is currently parsed. The goal is to switch to a flat token sequence and then rewrite the grammar using lemonade. Review issue #395 comments or files like parser code in the repository to understand the existing structure.