| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
entry. Now this is fixed by treating those as syntactic rules
|
|
|
|
|
|
NERC in Haskell and Java now refuses to recognize names that match words in the lexicon. The latest is useful for German
|
|
|
|
|
|
if case_sensitive=off
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Windows are just not supported.
|
|
|
|
|
|
|
|
if their probability differ with less that 0.5
|
|
|
|
with string literals
|
|
|
|
would gladly remove some code.
|
|
|
|
2 modules: Name clashes caused by Applicative-Monad change in Prelude
2 modules: Ambiguities caused by Foldable/Traversable in Prelude
2 modules: Backwards incompatible changes in time-1.5 for defaultTimeLocale
9 modules: {-# LANGUAGE FlexibleContexts #-} (because GHC checks inferred types
now, in addition to explicitly given type signatures)
Also silenced warnings about tab characters in source files.
|
|
|
|
|
|
|
|
|
|
|
|
The API in the C runtime as well as in the Haskell, Python and Java binding
is changed. Now instead of adding the literal callbacks to the concrete syntax
you need to supply them every time when you need to parse. The main reason is:
- referentially transparent API for Haskell
- when we start using memory mapped files we will not be allowed to change
anything in the grammar data structures. At that point the old API would
be impossible to use.
|
|
|
|
|
|
point operations.
|
|
|
|
|
|
|
|
BIND token which means that the App grammar was running about 2-3 times slower.
|
|
|
|
|
|
sums
|
|
|
|
|
