手工编写递归下降解析器的资源 [英] Resources for writing a recursive descent parser by hand
问题描述
我正在寻找一个手工编写递归下降解析器,我正在寻找有关如何构造它,算法等的良好资源.
I'm looking to write a recursive descent parser by hand and I'm looking for good resources on how to structure it, algorithms, etc.
推荐答案
在编译器模式"下,有一个关于codeproject的很好的教程.最近,您甚至可以只使用Google的编译器模式".
There is a good tutorial on codeproject under "Compiler Patterns". Lately, you can even just Google "compiler patterns".
http://www.codeproject.com/Articles/286121/Compiler-Patterns
本文涵盖了构建简单编译器的大多数方面(后端,BNF以及用于实现各种BNF规则的模式),但在理论上,甚至在为何使用递归下降编译器时,都不十分重视致力于将语言输入转换为代码.
The article covers most aspects of building a simple compiler (the back-end, the BNF, and the patterns used to implement the various BNF rules), but is not very heavy on theory, or even on why a recursive descent compiler works to convert language input into code.
这篇关于手工编写递归下降解析器的资源的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!