简体繁体 English

自动机和语法研究的工具支持

[英]Tool support for the study of automata and grammars

原文 2014-08-07 22:40:30 4 2 parsing/ grammar/ finite-automata/ automata

I'm studying Formal languages and compilers, and I'm doing a little bit hard to understand everything. 我正在研究形式语言和编译器，并且在理解所有内容方面有些困难。 Is there a tool that allows you to create automata and grammars and perform operations on them? 是否有工具可让您创建自动机和语法并对其执行操作？ Operations such as: minimize an automaton by automaton grammar, from grammar to automaton, make an epsilon-free grammar, etc. 诸如以下操作：通过自动机语法最小化自动机，从语法到自动机，制作无epsilon的语法等。

Thank you very much 非常感谢你

2 个解决方案

The Prolog-based Finite State Automata Utilities mentionned by rici seem a bit outdated and the online demo does not work, but it seems that there is some available precompiled binaries. rici提到的基于Prolog的有限状态自动机实用程序似乎有些过时了，在线演示无法正常工作，但似乎有一些可用的预编译二进制文件。

I used to make some experimentations with JFLAP a more recent Java based tool that is still maintained. 我曾经对JFLAP做过一些实验，而JFLAP是一个仍在维护的基于Java的更新工具。

(BTW, asking for tools is off-topic on SO, as it is not an implementation question.) （顺便说一句，索要工具在SO上是不合时宜的，因为这不是实现问题。）

Take a look at L-FLAT, a Logtalk Toolkit for Formal Languages and Automata Theory. 看看L-FLAT，这是用于形式语言和自动机理论的Logtalk工具包。 You can run it most Prolog compilers: 您可以在大多数Prolog编译器上运行它：

https://code.google.com/p/lflat/ https://code.google.com/p/lflat/

It includes several examples of defining and operating on automata. 它包括定义和操作自动机的几个示例。 There's also a paper about the system that you can download from: 您还可以下载有关该系统的论文：

http://arxiv.org/abs/1112.3783 http://arxiv.org/abs/1112.3783