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.