probcomp/bayeslite

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

Open

#395 创建于 2016年4月19日

在 GitHub 查看
 (0 评论) (0 反应) (0 负责人)Python (915 star) (63 fork)batch import
help wantedk dayslanguagemetamodel revision

描述

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.

贡献者指南

技术栈
python
领域
backenddatabase
议题类型
refactor
难度面向新贡献者的预计实现难度，1 表示很小改动，5 表示专家级工作。
4
预计时间有经验贡献者完成调查、实现、测试并准备 pull request 的粗略时间范围。
1-2 days
活动状态议题当前的可参与程度：新鲜、活跃、陈旧、阻塞或等待维护者输入。
stale
清晰度议题是否清楚说明期望改动、验收标准和下一步。
mostly clear
前置要求
Python programmingUnderstanding of parser design
新手友好度1-100 的估计分数，表示该议题对首次贡献者的友好程度。
30
研究方向
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.