blocks|key|2350155|text|手工编写LALR解析器很困难，但它是可以做到的。如果您想了解手动构建解析器背后的理论，请考虑阅读Grune和Jacobs的"Parsing+Techniques:+A+Practical+Guide“。这是一本关于一般解析技术的优秀书籍，其中关于LR解析的章节尤其出色。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2350156|如果您对获得用Java编写的LALR解析器更感兴趣，可以考虑研究Java+CUP，这是一个用于Java的通用解析器生成器。|2350157|希望这能有所帮助！|2350158|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|I|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|J|8|@]|9|@]|A|$]]|$1|F|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|G|$]]

Writing a LALR parser by hand is difficult, but it can he done. If you want to learn the theory behind constructing parsers for them by hand, consider looking into "Parsing Techniques: A Practical Guide" by Grune and Jacobs. It's an excellent book on general parsing techniques, and the chapter on LR parsing is particularly good.

If you're more interested in just getting a LALR parser that is written in Java, consider looking into Java CUP, which is a general purpose parser generator for Java.

Hope this helps!

blocks|key|443048|text|您可以将LALR功能分为两部分:准备表和解析输入。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|443049|第一部分很复杂，而且容易出错，所以即使您想知道它是如何工作的，我也建议您为LALR状态(以及记号赋予器DFA+)使用经过验证的工作表生成器。|443050|第二部分包括使用一些非常简单的算法来使用这些表，以将输入标记并处理为解析树/具体语法树。如果你喜欢这样做，你自己实现起来会更容易，而且你仍然可以完全控制它的工作方式和功能。|443051|当做解析任务时，我个人使用免费的GOLD+Parsing+System，它有一个很好的UI来创建和调试语法，它也生成表文件，然后可以由现有的引擎或您自己的实现加载和处理(这些CGT文件的文件格式有很好的文档记录)。|offset|length|443052|entityMap|0|LINK|mutability|MUTABLE|url|http://www.devincook.com/^0|0|0|0|G|J|0|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|S|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|T|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|U|8|@]|9|@$H|V|I|W|1|X]]|A|$]]|$1|J|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|K|$L|$5|M|N|O|A|$P|Q]]]]

You can split the LALR functionality in two parts: preparation of the tables and parsing the input.

The first part is complex and errorprone, so even if you like knowing how it works I suggest to use a proven working table generator for the LALR states (and for the tokenizer DFA as well).

The second part consists of consuming those tables using some quite simple algorithms to tokenize and process the input into a parse tree/concrete syntax tree. This is easier to implement yourself if you like to do so, and you still have full control over how it works and what it does.

When doing parsing tasks, I personally use the free <a href="http://www.devincook.com/" rel="nofollow">GOLD Parsing System</a>, which has a nice UI for creating and debugging the grammar and it does also generate table files which can then be loaded and processed by an existing engine or your own implementation (the file format for these CGT files is well documented).

blocks|key|5583338|text|如前所述，您将始终使用解析器生成器来生成LALAR解析器。针对Java的几个这样的工具包括：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5583339|5583340|SableCC+(我的personal+favourite)|unordered-list-item|offset|length|5583341|CUP|5583342|Beaver3|5583343|SJPT|5583344|Gold|5583345|5583346|entityMap|0|LINK|mutability|MUTABLE|url|http://sablecc.org/|1|http://www2.cs.tum.edu/projects/cup/|2|http://beaver.sourceforge.net/|3|4|http://sjpt.sourceforge.net/|5|http://www.devincook.com/goldparser/^0|0|0|0|7|0|0|0|3|1|0|0|6|2|6|1|3|0|0|4|4|0|0|4|5|0|0^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|18|8|@]|9|@]|A|$]]|$1|C|3|D|5|E|7|19|8|@]|9|@$F|1A|G|1B|1|1C]]|A|$]]|$1|H|3|I|5|E|7|1D|8|@]|9|@$F|1E|G|1F|1|1G]]|A|$]]|$1|J|3|K|5|E|7|1H|8|@]|9|@$F|1I|G|1J|1|1K]|$F|1L|G|1M|1|1N]]|A|$]]|$1|L|3|M|5|E|7|1O|8|@]|9|@$F|1P|G|1Q|1|1R]]|A|$]]|$1|N|3|O|5|E|7|1S|8|@]|9|@$F|1T|G|1U|1|1V]]|A|$]]|$1|P|3|-4|5|6|7|1W|8|@]|9|@]|A|$]]|$1|Q|3|-4|5|6|7|1X|8|@]|9|@]|A|$]]]|R|$S|$5|T|U|V|A|$W|X]]|Y|$5|T|U|V|A|$W|Z]]|10|$5|T|U|V|A|$W|11]]|12|$5|T|U|V|A|$W|11]]|13|$5|T|U|V|A|$W|14]]|15|$5|T|U|V|A|$W|16]]]]

As previously stated, you would always use a parser-generator to produce an LALAR parser. A few such tools for Java are:

<ul>
<li><a href="http://sablecc.org/" rel="nofollow">SableCC</a> (my personal favourite)</li>
<li><a href="http://www2.cs.tum.edu/projects/cup/" rel="nofollow">CUP</a></li>
<li><a href="http://beaver.sourceforge.net/" rel="nofollow">Beaver</a><a href="http://beaver.sourceforge.net/" rel="nofollow">3</a></li>
<li><a href="http://sjpt.sourceforge.net/" rel="nofollow">SJPT</a></li>
<li><a href="http://www.devincook.com/goldparser/" rel="nofollow">Gold</a></li>
</ul>

blocks|key|3471496|text|我只想提一下，我的项目CookCC+(+http://coconut2015.github.io/cookcc/+)是一个LALR(1)解析器%2B+Lexer+(很像flex)。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3471497|CookCC的独特之处在于，您可以使用Java在Java语言中编写词法分析器和解析器。请参阅此处的计算器示例：https://github.com/coconut2015/cookcc/blob/master/tests/javaap/calc/Calculator.java|3471498|entityMap|0|LINK|mutability|MUTABLE|url|http://coconut2015.github.io/cookcc/|1|https://github.com/coconut2015/cookcc/blob/master/tests/javaap/calc/Calculator.java^0|K|10|0|0|1J|2B|1|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|@$A|U|B|V|1|W]]|C|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]|N|$5|I|J|K|C|$L|O]]]]

Just want to mention that my project CookCC ( <a href="http://coconut2015.github.io/cookcc/" rel="nofollow noreferrer">http://coconut2015.github.io/cookcc/</a> ) is a LALR(1) parser + Lexer (much like flex).

The unique feature of CookCC is that you can write your lexer and parser in Java using Java annotations. See the calculator example here: <a href="https://github.com/coconut2015/cookcc/blob/master/tests/javaap/calc/Calculator.java" rel="nofollow noreferrer">https://github.com/coconut2015/cookcc/blob/master/tests/javaap/calc/Calculator.java</a>

I want to write Java code to build a LALR parser for my grammar. Can someone please suggest some books or some links where I can learn how to write Java code for a LALR parser?

How to write LALR parser for some grammar in Java?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我想编写Java代码来为我的语法构建一个LALR解析器。有没有人可以推荐一些书或链接，让我学习如何为LALR解析器编写Java代码？

问如何在Java中编写一些语法的LALR解析器？
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何在Java中编写一些语法的LALR解析器？EN