GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-04-09 13:09:33 -06:00
Code Issues Packages Projects Releases Wiki Activity

Updated another reference to "Regular approximation of CFLs: a grammatical view"

Browse Source
This commit is contained in:
bringert
2007-01-03 18:28:25 +00:00
parent 8aa283aebd
commit bf8b078a7a
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

@@ -218,7 +218,7 @@ compileAutomata g = [(c, makeOneFA c) | c <- allCats 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,
-- adapted to build a finite automaton for a single (mutually recursive) set only.
-- Categories not in the set will result in category-labelled edges.
make_fa1 :: MutRecSet -- ^ The set of (mutually recursive) categories for which