ChristmasTree-0.1: Changing Haskell's Read Implementation Such That by Mainpulating Abstract Syntax Trees it Reads Expressions EfficientlyContentsIndex
Search:
.#.
.*.
append
app_prec
Close
consD
consG
DEnd
dEnd
deriveGrammar
deriveShow
deriveSimpleGrammar
DGD
DGG
DGram
DGrammar
1 (Type/Class)
2 (Data Constructor)
DLNontDefs
1 (Type/Class)
2 (Data Constructor)
DNont
dNont
DProd
DProductions
DPS
DRef
1 (Type/Class)
2 (Data Constructor)
DSeq
DSymbol
DTerm
dTerm
End
ext
Gram
Grammar
1 (Type/Class)
2 (Data Constructor)
grammar
gread
GReadMsg
GReadResult
GShow
gshow
gshowsPrec
Keyw
matchSym
Nont
Ok
Open
parenT
Prod
Productions
PS
Rep
Seq
Symbol
Term
Token
unDPS
unPS