blocks|key|2882553|text|这和挖掘维基百科中的相关条款可能就足够了。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2882554|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/570144/best-practices-for-writing-the-parser|1|http://en.wikipedia.org/wiki/Recursive_descent_parser^0|0|1|0|A|4|1|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]|$A|R|B|S|1|T]]|C|$]]|$1|D|3|-4|5|6|7|U|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]|L|$5|G|H|I|C|$J|M]]]]

<a href="https://stackoverflow.com/questions/570144/best-practices-for-writing-the-parser">This</a> and digging through wikipedia for <a href="http://en.wikipedia.org/wiki/Recursive_descent_parser" rel="nofollow noreferrer">related articles</a> will probably suffice.

blocks|key|1358548|text|每个人都认为您在谈论XML是有原因的:面对XML解析器的成熟和容易获得，发明一种专有的基于文本的文件格式需要非常有力的理由。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1358549|您的问题表明，您对解析器的先验知识非常有限(否则您将编写反或JavaCC语法，而不是问这个问题)--这是反对滚动您自己的语法的另一个强有力的论据，但作为一种学习体验除外。|offset|length|1358550|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Antlr|1|http://en.wikipedia.org/wiki/JavaCC^0|0|S|1|0|U|6|1|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]|$D|U|E|V|1|W]]|A|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]|N|$5|I|J|K|A|$L|O]]]]

There's a reason that everyone assumes you're talking about XML: inventing a proprietary text-based file format requires very strong justification in the face of the maturity and easy availability of XML parsers. 

And your question indicates that you have very little prior knowledge about parsers (otherwise you'd be writing an <a href="http://en.wikipedia.org/wiki/Antlr" rel="noreferrer">ANTLR</a> or <a href="http://en.wikipedia.org/wiki/JavaCC" rel="noreferrer">JavaCC</a> grammar instead of asking this question) - which is another strong argument against rolling your own, except as a learning experience.

blocks|key|2882280|text|由于输入是“格式类似于”，所以您的数据很可能最好使用类似树的结构来表示，而且很可能是XML或类似于XML。|type|unstyled|depth|inlineStyleRanges|offset|length|style|BOLD|entityRanges|data|2882281|如果是这样的话，我建议解析文件的最明智的方法是使用XML解析器。|2882282|以下是您可能会发现有帮助的一些资源：|2882283|关于Sun：http://java.sun.com/developer/Books/xmljava/ch03.pdf的XML解析的一章|unordered-list-item|2882284|一篇可能帮助你更好地入门的文章：http://onjava.com/pub/a/onjava/2002/06/26/xml.html|2882285|HTH|2882286|entityMap|0|LINK|mutability|MUTABLE|url|http://java.sun.com/developer/Books/xmljava/ch03.pdf|1|http://onjava.com/pub/a/onjava/2002/06/26/xml.html^0|6|5|0|0|0|6|1G|0|0|G|1E|1|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@$9|11|A|12|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|13|8|@]|D|@]|E|$]]|$1|H|3|I|5|6|7|14|8|@]|D|@]|E|$]]|$1|J|3|K|5|L|7|15|8|@]|D|@$9|16|A|17|1|18]]|E|$]]|$1|M|3|N|5|L|7|19|8|@]|D|@$9|1A|A|1B|1|1C]]|E|$]]|$1|O|3|P|5|6|7|1D|8|@]|D|@]|E|$]]|$1|Q|3|-4|5|6|7|1E|8|@]|D|@]|E|$]]]|R|$S|$5|T|U|V|E|$W|X]]|Y|$5|T|U|V|E|$W|Z]]]]

Since the input is "formatted similarly to HTML", then it is likely that your data is best represented using a tree-like structure, and also, it is likely that it is XML or similar to XML.

If this is the case, I propose the smartest way to parse your file is to use an XML parser.

Here are some resources you may find helpful:

<ul>
<li>A chapter on XML parsing from Sun: <a href="http://java.sun.com/developer/Books/xmljava/ch03.pdf" rel="noreferrer">http://java.sun.com/developer/Books/xmljava/ch03.pdf</a></li>
<li>An article that might help you get started qucikly: <a href="http://onjava.com/pub/a/onjava/2002/06/26/xml.html" rel="noreferrer">http://onjava.com/pub/a/onjava/2002/06/26/xml.html</a></li>
</ul>

HTH

blocks|key|1210050|text|如果文档是有效的XML，那么其他任何答案都可以。如果不是，你就会必须要莱克斯。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1210051|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/611820/which-java-oriented-lexer-parser-for-simple-project-antlr-diy-etc^0|W|6|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]]]]

If the document is valid XML, then any of the other answers will work. If it's not, you'll <a href="https://stackoverflow.com/questions/611820/which-java-oriented-lexer-parser-for-simple-project-antlr-diy-etc">have to lex</a>.

blocks|key|1358571|text|您应该看看ANTLR，即使您想自己编写解析器，ANTLR也是一个很好的选择。或者至少看看YAML|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1358572|entityMap|0|LINK|mutability|MUTABLE|url|http://www.yaml.org/^0|18|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]]]]

you should look at ANTLR even if you want to write the parser yourself, ANTLR is a great alternative. Or at least look at <a href="http://www.yaml.org/" rel="nofollow noreferrer">YAML</a>

blocks|key|1358711|text|我想java.util.Scanner会帮你的。看看http://java.sun.com/javase/6/docs/api/java/util/Scanner.html|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1358712|entityMap|0|LINK|mutability|MUTABLE|url|http://java.sun.com/javase/6/docs/api/java/util/Scanner.html^0|Q|1O|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 think the java.util.Scanner will help you. Have a look at <a href="http://java.sun.com/javase/6/docs/api/java/util/Scanner.html" rel="nofollow noreferrer">http://java.sun.com/javase/6/docs/api/java/util/Scanner.html</a>

blocks|key|1210034|text|根据“模式”的复杂程度，正则表达式可能是您想要的。如果有很多嵌套，那么将其转换为XML或JSON并使用预构建的解析器可能是最简单的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1210035|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|$]]

Depending on how complicated your "schema" is, a regular expression might be what you want. If there is a lot of nesting then it might be easiest to convert to XML or JSON and use a prebuilt parser.

blocks|key|2882594|text|在查看了示例输入之后，我看不到与HTML或XML有任何相似之处：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2882595|-barfoob:+boobs,+foob,+"foo+bar"|offset|length|style|CODE|2882596|如果这是您想要解析的，我有一个替代的建议，使用Java属性解析器(随标准Java一起提供)，然后使用您自己的自定义代码解析每一行的其余部分。您需要在一定程度上重构您的格式，这样才能使其工作，因此这取决于您。|2882597|barfoob=boobs,+foob,+"foo+bar"|2882598|Java将能够返回barfoob作为属性名，boobs,+foob,+"foo+bar"作为属性值返回。在这里，您可以使用自定义代码将属性值拆分为boobs、foob和foo+bar。|2882599|entityMap^0|0|0|W|0|0|0|U|0|9|7|M|M|21|5|27|4|2C|7|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@$D|R|E|S|F|G]]|9|@]|A|$]]|$1|H|3|I|5|6|7|T|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|U|8|@$D|V|E|W|F|G]]|9|@]|A|$]]|$1|L|3|M|5|6|7|X|8|@$D|Y|E|Z|F|G]|$D|10|E|11|F|G]|$D|12|E|13|F|G]|$D|14|E|15|F|G]|$D|16|E|17|F|G]]|9|@]|A|$]]|$1|N|3|-4|5|6|7|18|8|@]|9|@]|A|$]]]|O|$]]

After looking at your sample input, I fail to see any resemblance to HTML or XML:

<code>-barfoob: boobs, foob, "foo bar"</code>

If this is what you want to parse, I have an alternative suggestion, to use the Java properties parser (comes with standard Java), and then parse the remainder of each line using your own custom code. You will need to refactor your format somewhat in order for this to work, so it's up to you.

<code>barfoob=boobs, foob, "foo bar"</code>

Java properties will be be able to return you <code>barfoob</code> as the property name, and <code>boobs, foob, "foo bar"</code> as the property value. That's where you can use your custom code to split the property value into <code>boobs</code>, <code>foob</code> and <code>foo bar</code>.

blocks|key|1208984|text|我强烈建议不要重新发明轮子，使用现有的解决方案，比如扁虫、Fixedformat4j或jFFP，这些解决方案都可以解析位置或逗号分隔的值文件(就我个人而言，我推荐平台蠕虫)。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1208985|entityMap|0|LINK|mutability|MUTABLE|url|http://flatworm.sourceforge.net/|1|http://fixedformat4j.ancientprogramming.com/|2|http://jffp.sourceforge.net/^0|Q|2|0|T|D|1|17|4|2|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]|$A|T|B|U|1|V]|$A|W|B|X|1|Y]]|C|$]]|$1|D|3|-4|5|6|7|Z|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]|L|$5|G|H|I|C|$J|M]]|N|$5|G|H|I|C|$J|O]]]]

I'd strongly advice to not reinvent the wheel and use an existing solution like <a href="http://flatworm.sourceforge.net/" rel="nofollow noreferrer">Flatworm</a>, <a href="http://fixedformat4j.ancientprogramming.com/" rel="nofollow noreferrer">Fixedformat4j</a> or <a href="http://jffp.sourceforge.net/" rel="nofollow noreferrer">jFFP</a> that can all parse positional or comma-separated values files (personally, I recommend Flatworm).

blocks|key|1358451|text|您可以在一定程度上使用Neko+HTML解析器。这取决于它如何处理非标准的HTML。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1358452|entityMap|0|LINK|mutability|MUTABLE|url|http://nekohtml.sourceforge.net/^0|B|C|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]]]]

You may be able to use the <a href="http://nekohtml.sourceforge.net/" rel="nofollow noreferrer">Neko HTML parser</a> to some degree. It depends on how it handles the non-standard HTML.

blocks|key|1208846|text|如果XML是有效的，我个人更喜欢使用http://www.xom.nu，因为它具有一个很好的DOM模型。但是，正如所指出的，J2SE中有解析器。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1208847|entityMap|0|LINK|mutability|MUTABLE|url|http://www.xom.nu/^0|I|H|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]]]]

If the XML is valid, I personally prefer using <a href="http://www.xom.nu" rel="nofollow noreferrer">http://www.xom.nu</a> simply because it features a nice DOM model. As pointed out, though, there are parsers in J2SE.

EDIT: I'm mostly parsing "comma-seperated values", fuzzy brought that term to my attention.

Interpreting the blocks of CSV are the main question here.

I know how to read the file into something like a <code>String[]</code> and some of the basic features of <code>String</code>, but I don't think using methods like <code>contains()</code> and analyzing everything character by character will work.

What are some ways I can do this in a smarter way?

Example of a line:

<code>-barfoob: boobs, foob, "foo bar"</code>

Tips for writing a file parser in Java?

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

编辑:我主要是解析“逗号分隔的值”，模糊引起了我的注意.解释CSV的块是这里的主要问题。我知道如何将文件读入类似String[]的内容和String的一些基本特性，但我不认为使用contains()之类的方法并逐字符分析所有内容都是可行的。我能用更聪明的方法做这件事吗？线的例子：-barfoob: boobs, foob, "foo bar"

问用Java编写文件解析器的技巧？
EN

回答 11

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问用Java编写文件解析器的技巧？EN

回答 11

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问用Java编写文件解析器的技巧？
EN