2

I'm trying to use Ragel to implement a simple yes/no fsm. Unfortunately the language specification consists of the union of about a thousand regular expressions, with * operators appearing once or more in the majority of them. So, the number of possible states explodes and it seems it will be impossible to use Ragel to generate an fsm for my language. Is there a tool out there that can do what I need, or should I swap approaches? I need something better than checking input strings against each regular expression in turn. I could chop up the thousand regular expressions into chunks of ~50 and generate an fsm for each, and run every input string against all the machines, but if there's a tool that can handle this kind of job without such a hack I'd be pleased to hear of it.

Thanks!

4

1 に答える 1

1

Ragel が利用可能なすべてのメモリを消費するのを防ぐために、マシンを複数のマシンに分割することになりました。生成された巨大な状態テーブルから。誰かが持っているなら、これに対するより良い解決策を聞くことにまだ興味があります!

于 2010-06-22T20:04:07.357 に答える