| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
-new-comp
|
|
|
|
different compiler then we simply recompile it.
|
|
most detailed mode and it can print even things that are not in the GF syntax. For example PMCFG snippets and indirections.
|
|
|
|
compilation schema is few times faster.
|
|
separate PGF building
|
|
of the different definitions. There is a --tags option which generates a list of all identifiers with their source locations.
|
|
This makes it easier to treat run-time errors (e.g. caused by calls to
Predef.error) in a way that is more typical for a lazy functional language.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
the Err monad to arbitrary monads
|
|
Still keeping the modules both in a list and in a finite map. The overhead is
smaller than I initially thought.
|
|
list
This speeds up the compilation of PhrasebookFin.pgf by 12%, mosly by speeding
up calls to lookupModule in calls from lookupParamValues, in calls
from allParamValues.
The invariant "modules are stored in dependency order" is no longer respected!
But the type MGrammar is now abstract, making it easier to maintain this or
other invariants in the future.
|
|
+ Avoids some code duplication by combinging lookupModule and lookupIdentInfo.
+ Also removed lookupIdentInfo from export list, since it is not used anywhere
else.
|
|
|
|
|
|
|
|
'instance Foo of Bar - [f,g,h]'
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
as <> instead of {} to distinguish from empty record type
|
|
|
|
grammar. It may not be used accurately in the error messages yet
|
