hallgren
b4207d1b00
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
hallgren
5e091d2e3d
partial evaluator work
...
* Evaluate operators once, not every time they are looked up
* Remember the list of parameter values instead of recomputing it from the
pattern type every time a table selection is made.
* Quick fix for partial application of some predefined functions.
2012-12-11 15:37:41 +00:00
kr.angelov
7863b21c1a
more stuff in the new type checker
2011-11-30 14:55:52 +00:00
kr.angelov
416d231c5e
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
734c66710e
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
5fe49ed9f7
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
ed451653bd
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
aarne
33a42b1c7c
module for analysing source grammars
2011-09-20 16:00:56 +00:00
aarne
a2ccf1ce69
command ss to show source (including gfo) in text; to be extended
2011-09-20 14:58:27 +00:00
hallgren
d180dadf08
GF.Infra.Modules: minor tweaks
...
Still keeping the modules both in a list and in a finite map. The overhead is
smaller than I initially thought.
2011-08-31 11:18:16 +00:00
hallgren
ba10b5b0ca
GF.Infra.Modules: keep the modules of a grammar in a finite map instead of a 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.
2011-08-30 18:54:50 +00:00
krasimir
115b4213d5
operations in the abstract syntax
2010-11-12 19:37:19 +00:00
krasimir
992a7ffb38
Yay!! Direct generation of PMCFG from GF grammar
2010-06-18 12:55:58 +00:00
krasimir
c3f4c3eba7
refactoring in GF.Grammar.Grammar
2010-05-28 14:15:15 +00:00
krasimir
bf74f50733
store and propagate the exact source location for all judgements in the grammar. It may not be used accurately in the error messages yet
2010-03-22 21:15:29 +00:00
krasimir
f870c4d80f
syntax for inaccessible patterns in GF
2010-03-18 19:34:30 +00:00
krasimir
19b17dceb6
no need to keep the list of constructors per category in .gfo
2010-02-16 09:34:02 +00:00
krasimir
be6465a2eb
refactor GF.Infra.Modules for better error messages
2010-01-31 15:54:25 +00:00
krasimir
f85232947e
reorganize the directories under src, and rescue the JavaScript interpreter from deprecated
2009-12-13 18:50:29 +00:00