hallgren
|
4aa3638549
|
GF.Grammar.Lookup: new function lookupResDefLoc
It's like lookupResDef but it includes a source location in the output.
|
2012-12-19 23:08:56 +00:00 |
|
aarne
|
8b07c2607d
|
bug fix in AppPredefined: don't compare values that contain variables. this should be checked even more generally.
|
2012-02-28 15:13:32 +00:00 |
|
aarne
|
a777481313
|
the Predef function eqVal to compare equality of parameter values
|
2012-02-24 10:00:27 +00:00 |
|
kr.angelov
|
bbe42d1e90
|
Now PMCFG is compiled per module and at the end we only link it. The new compilation schema is few times faster.
|
2011-11-10 14:09:41 +00:00 |
|
kr.angelov
|
54019c75ae
|
merge GF.Infra.Modules and GF.Grammar.Grammar. This is a preparation for the separate PGF building
|
2011-11-02 13:57:11 +00:00 |
|
kr.angelov
|
bc35626489
|
Now the compiler maintains more precise information for the source locations of the different definitions. There is a --tags option which generates a list of all identifiers with their source locations.
|
2011-11-02 11:44:59 +00:00 |
|
hallgren
|
a8b97caed4
|
Introduce an explicit error value in the Term type
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.
|
2011-10-20 14:36:30 +00:00 |
|
hallgren
|
61c54d4490
|
AppPredefined.hs: more readable notation for the types of primitives
|
2011-10-20 14:17:37 +00:00 |
|
aarne
|
7d3949a270
|
Predef functions toUpper, toLower, isUpper
|
2011-06-02 16:10:46 +00:00 |
|
krasimir
|
51e4f36b80
|
the abstract syntax for Predef.gf is now hard-coded in AppPredefined.hs
|
2010-07-01 15:38:16 +00:00 |
|
krasimir
|
527efbef9d
|
reorganize the modules in GF.Compile.*
|
2010-07-01 14:19:32 +00:00 |
|