mairix/mairix-0.24/dfasyn

dfasyn is a tool for constructing state machines.  The input language allows a
lot of generality.  For example, it allows repeated elements to be specified
where the items have constraints between the end of one and the start of the
next.   (I could not find a way to define such an automaton in the lex/flex
input language, which prompted the writing of the tool.)  Currently, you must
do a fair amount of work yourself to build a parser around the resulting state
machine.
Name		Date	Size	#Lines	LOC
..		03-May-2022	-
.gitignore	H A D	13-Aug-2017	42	6	5
COPYING	H A D	13-Aug-2017	17.6 KiB	340	281
INSTALL	H A D	13-Aug-2017	358	20	10
Makefile	H A D	13-Aug-2017	1.6 KiB	63	32
NEWS	H A D	13-Aug-2017	70	6	3
README	H A D	13-Aug-2017	476	9	7
abbrevs.c	H A D	13-Aug-2017	1.9 KiB	68	34
blocks.c	H A D	13-Aug-2017	4.4 KiB	169	113
charclass.c	H A D	13-Aug-2017	7.9 KiB	365	289
compdfa.c	H A D	13-Aug-2017	13.8 KiB	480	306
configure	H A D	13-Aug-2017	34	5	1
dfasyn.1	H A D	13-Aug-2017	3.6 KiB	155	138
dfasyn.5	H A D	13-Aug-2017	15.4 KiB	651	559
dfasyn.c	H A D	13-Aug-2017	20.5 KiB	691	553
dfasyn.h	H A D	13-Aug-2017	10.6 KiB	366	235
dfasyn.texi	H A D	13-Aug-2017	2.4 KiB	86	66
evaluator.c	H A D	13-Aug-2017	5.9 KiB	249	173
expr.c	H A D	13-Aug-2017	5.4 KiB	244	179
n2d.c	H A D	13-Aug-2017	18.5 KiB	697	527
n2d.h	H A D	13-Aug-2017	7.4 KiB	227	133
parse.y	H A D	13-Aug-2017	8.6 KiB	263	185
scan.l	H A D	13-Aug-2017	4.6 KiB	112	77
states.c	H A D	13-Aug-2017	8.8 KiB	304	244
stimulus.c	H A D	13-Aug-2017	2.2 KiB	88	49
tabcompr.c	H A D	13-Aug-2017	5.5 KiB	182	106
tokens.c	H A D	13-Aug-2017	2.1 KiB	86	52