msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity

Updated reference to regular -> FA conversion.

Browse Source
This commit is contained in:
bringert
2007-01-03 18:17:32 +00:00
parent 5aa5005ba8
commit f6a5ea8738
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/GF/Speech/CFGToFiniteState.hs
View File

@@ -104,7 +104,7 @@ compileAutomaton start g = make_fa (g,ns) s [Cat start] f fa
ns = mutRecSets g $ mutRecCats False g
-- | The make_fa algorithm from \"Regular approximation of CFLs: a grammatical view\",
-- Mark-Jan Nederhof. International Workshop on Parsing Technologies, 1997.
-- Mark-Jan Nederhof, Advances in Probabilistic and other Parsing Technologies, 2000.
make_fa :: (CFRules,MutRecSets) -> State -> [Symbol Cat_ Token] -> State
-> NFA Token -> NFA Token
make_fa c@(g,ns) q0 alpha q1 fa =