blocks|key|1485474|text|Antlr被广泛使用，有很好的文档记录，而且是免费的。它得到了Ant的支持，可以在许多其他语言中以Java为目标。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1485475|entityMap|0|LINK|mutability|MUTABLE|url|http://www.antlr.org/^0|0|5|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

<a href="http://www.antlr.org/" rel="noreferrer">Antlr</a> is widely used, well documented, and free. It is supported by Ant, and can target Java among many other languages.

blocks|key|1485926|text|我不使用词法分析器和解析器生成器。它们非常简单，可以手工生成，并且是编译器中最容易编写的部分。此外，当你手工构建它们时，你可以让它们变得非常快。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1485927|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

I don't use lexer and parser generators. They're simple enough to generate by hand, and are the easiest parts of a compiler to write. Besides, when you build them by hand, you can make them really fast.

blocks|key|1700666|text|Lex和Yacc仍在使用中。F#是目前最新的语言之一，它有自己的版本(fslex、fsyacc+--有关示例，请参阅here+)。所以我认为教授他们仍然是有意义的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1700667|entityMap|0|LINK|mutability|MUTABLE|url|http://strangelights.com/blog/archive/2006/05/11/1302.aspx^0|1M|4|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

Lex and Yacc are still in use. One of the newest languages around, F#, has it's own versions (fslex, fsyacc -- see <a href="http://strangelights.com/blog/archive/2006/05/11/1302.aspx" rel="nofollow noreferrer">here</a> for an example.) So I think teaching them is still relevant.

blocks|key|1701284|text|Yacc和所有其他LALR(1)解析器的历史可以追溯到机器资源稀缺的时代，有必要花费大量时间设计语法，以便您可以在具有64K+RAM的PDP-11上运行解析器。今天，教一个像yacc这样的工具是没有意义的，因为它的人性化界面很糟糕，而且它能使用的语法非常有限。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1701285|我推荐两个基于PEG的解析器，比如Rats!，或者George+Necula和Scott+McPeak开发的GLR解析器Elkhound+(感谢夸克)。对不起，我不能为Java推荐一个特定的工具，但是Rats！对C。|offset|length|1701286|ANTLR还可以，但对我来说太复杂了。|1701287|entityMap|0|LINK|mutability|MUTABLE|url|http://www.scottmcpeak.com/elkhound/^0|0|1O|8|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@$D|R|E|S|1|T]]|A|$]]|$1|F|3|G|5|6|7|U|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|V|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|O]]]]

Yacc and all the other LALR(1) parsers date from an era when machine resources were scarce and it was necessary to spend a lot of time engineering the grammar so that you could run a parser at all on a PDP-11 with 64K of RAM. Today it does not make sense to teach a tool like yacc with a terrible human interface and a very limited set of grammars it can use.

I would recommend either one of the PEG-based parsers, such as Rats!, or the GLR parser <a href="http://www.scottmcpeak.com/elkhound/" rel="nofollow noreferrer">Elkhound</a> developed by George Necula and Scott McPeak (thanks quark). Sorry I can't recommend a specific tool for Java, but Rats! is good for C.

ANTLR is OK but is too complex for my taste.

blocks|key|1485755|text|像RATS这样的PEG解析器系统比lex/yacc组合更简单。这可能对你的课程有好处，也可能没有:你的目标是教授正则表达式和有限自动机，以及LR语法和下推自动机等吗？或者你想要最简单实用的编译器前端工具？|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1485756|(因为这些天我不用Java编程，所以我也没有特别尝试过RATS。)|1485757|entityMap|0|LINK|mutability|MUTABLE|url|http://cs.nyu.edu/rgrimm/xtc/rats.html^0|1|4|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

PEG parser systems like <a href="http://cs.nyu.edu/rgrimm/xtc/rats.html" rel="nofollow noreferrer">RATS</a> are simpler than the lex/yacc combo. This may or may not be a plus for your class: is your goal to teach about regular expressions and finite automata, and LR grammars and pushdown automata, etc.? Or do you want the simplest practical compiler frontend tools?

(Since I don't program in Java these days I haven't tried RATS in particular.)

blocks|key|1485983|text|Javacc这很简单。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1485984|在同一个文件中，您有语法和令牌列表。|1485985|https://javacc.dev.java.net/|offset|length|1485986|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|S|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|P|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Q|8|@]|9|@$F|R|G|S|1|T]]|A|$]]|$1|H|3|-4|5|6|7|U|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|E]]]]

Javacc it's very easy. 
In the same file you have the grammar and the token list. 

<a href="https://javacc.dev.java.net/" rel="nofollow noreferrer">https://javacc.dev.java.net/</a>

blocks|key|1485635|text|您可以跳过生成器部分，看看Scalas解析器组合子。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1485636|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

You could skip the generator part and have a look at Scalas parser combinators.

blocks|key|1701150|text|如果您计划使用Java，JavaCC或ANTLR语言应该就足够了。后者还支持C和Python。但是如果你打算使用C%2B%2B，也许你应该看看Boost::Spirit。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1701151|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

If you plan to work with Java, JavaCC or ANTLR should suffice. This latter one also supports C and Python. But if you plan to work with C++, maybe you should take a look at Boost::Spirit.

blocks|key|1486109|text|我还没试过，但我几天前找到了jparsec。它不是解析器生成器，取而代之的是，解析器是由EBNF风格的组合子在java中构建的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1486110|entityMap|0|LINK|mutability|MUTABLE|url|http://jparsec.codehaus.org/^0|E|7|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

Haven't tried it yet, but I found <a href="http://jparsec.codehaus.org" rel="nofollow noreferrer">jparsec</a> a few days ago. It is no parser generator, instead the parser is build in java by combinators in an EBNF style.

blocks|key|1701403|text|我非常喜欢GOLD+Parsing+System，因为它基本上生成所需的表，然后您只需使用处理器的(通用)实现，该处理器使用表信息来处理令牌。这个引擎(就像它所说的那样)非常容易编写，基本上是一个使用LALR和DFA表来处理输入的纯实现，编写这样的实现可能是一个很好的练习。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1701404|entityMap|0|LINK|mutability|MUTABLE|url|http://www.devincook.com/^0|5|J|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

I like the <a href="http://www.devincook.com/" rel="nofollow noreferrer">GOLD Parsing System</a> very much, because it basically generates the tables needed and you then only have to use a (generic) implementation of a processor which uses the table information to process the tokens. This engine (as it is called) is quite easy to write and is basically a pure implementation using the LALR and DFA tables to process the input, and writing such an implementation may be a good exercise to teach those.

blocks|key|1485830|text|我目前正在学习一个使用Lex和Yacc的编译器课程。我真的不知道有没有其他类型，但我们正在学习的理论似乎很好地映射到这些工具。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1485831|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

I am currently taking a compilers course which uses Lex and Yacc. I don't really know about any other types out there, but the theory we're learning seems to map pretty well to these tools.

blocks|key|1701095|text|我记得在我的一个编译器类中使用了Bison。我们还使用了flex和YACC。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1701096|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

I remember using Bison in one of my compilers classes. We also used flex and YACC.

blocks|key|1486264|text|OCaml有一组奇妙的解析器生成器。Here是一些简单的例子。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1486265|JavaCC也相当不错。|1486266|为此，我强烈建议避免使用C(和C%2B%2B)，因为在这种情况下，它们非常痛苦。|1486267|entityMap|0|LINK|mutability|MUTABLE|url|http://www.ffconsultancy.com/ocaml/benefits/parsing.html^0|I|4|0|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]]|C|$]]|$1|D|3|E|5|6|7|T|8|@]|9|@]|C|$]]|$1|F|3|G|5|6|7|U|8|@]|9|@]|C|$]]|$1|H|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|I|$J|$5|K|L|M|C|$N|O]]]]

OCaml has a fantastic set of parser generators. <a href="http://www.ffconsultancy.com/ocaml/benefits/parsing.html" rel="nofollow noreferrer">Here</a> are some simple examples.

JavaCC is also quite good.

I would strongly recommend avoiding C (and C++) for this purpose because they are extraordinary painful in this context.

I am teaching (with others) a relatively introductory course in computer science for IT professionals without a background in CS. Since I developed the course materials on automata and grammars, I am also responsible for teaching about compilers and compiler construction.

Years ago, when I studied compilation in college, all our examples came from Lex and Yacc. Are these still in widespread use? Is there something that is more commonly used for Java? The students are proficient in C and Java but have never used parser generators.

Any tips on what to teach would be appreciated

Which parser generator to teach my students?

我正在(与其他人)为没有计算机科学背景的IT专业人员教授一门相对入门的计算机科学课程。由于我开发了自动机和语法的课程材料，我还负责教授编译器和编译器构造。几年前，当我在大学里学习编译时，我们所有的例子都来自Lex和Yacc。这些还在广泛使用吗？有没有更常用于Java的东西？这些学生精通C和Java，但从未使用过解析器生成器。如有任何关于教学内容的建议，我们将不胜感激

问教我的学生使用哪种解析器生成器？
EN

回答 13

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问教我的学生使用哪种解析器生成器？EN

回答 13

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问教我的学生使用哪种解析器生成器？
EN