diff options
| author | bringert <bringert@cs.chalmers.se> | 2007-01-03 18:17:32 +0000 |
|---|---|---|
| committer | bringert <bringert@cs.chalmers.se> | 2007-01-03 18:17:32 +0000 |
| commit | b1cde222bfb7a02aa72a3fa4ea7247cca4cef5bf (patch) | |
| tree | 2036e6c7e1c81d2657dd29932fd82262c85cce50 /src/GF/Speech | |
| parent | 475d53565195233d3928847c98cef69fc19c56c4 (diff) | |
Updated reference to regular -> FA conversion.
Diffstat (limited to 'src/GF/Speech')
| -rw-r--r-- | src/GF/Speech/CFGToFiniteState.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/GF/Speech/CFGToFiniteState.hs b/src/GF/Speech/CFGToFiniteState.hs index 47ad4b7fe..feb4db0ed 100644 --- a/src/GF/Speech/CFGToFiniteState.hs +++ b/src/GF/Speech/CFGToFiniteState.hs @@ -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 = |