A unified representation for teaching bottom-up and top-down parsing
Journal of Computing Sciences in Colleges（2020）
摘要
A trie-based model for context-free grammars is described that supports teaching both LL(1) and LR(1) parsing. In the model, grammar rules and parse states are embedded in a trie graph , which is modified version of a characteristic finite state machine (CFSM) used in the design of LR(1) parsers.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要