barley-0.3: seed/static/codemirror_parse_haskell.js
var HaskellParser = Editor.Parser = (function() {
var tokenizeHaskell = (function() {
// These should all be Unicode extended, as per the Haskell 2010 report
var smallRE = /[a-z_]/;
var largeRE = /[A-Z]/;
var digitRE = /[0-9]/;
var hexitRE = /[0-9A-Fa-f]/;
var octitRE = /[0-7]/;
var idRE = /[a-z_A-Z0-9']/;
var symbolRE = /[-!#$%&*+.\/<=>?@\\^|~:]/;
var whiteCharRE = /[ \t\v\f]/; // newlines are handled in tokenizer
function nextIfLiteralChar(delimiter) {
if (source.endOfLine()) return false;
if (source.equals(delimiter)) return false;
if (source.equals('\\')) {
source.next();
source.next();
}
else {
source.next();
}
return true
}
function normal(source, setState) {
var ch = source.next();
if (/[(),;[\]`{}]/.test(ch)) {
if (ch == '{' && source.equals('-')) {
source.next();
var t = "hs-comment";
if (source.equals('#')) {
source.next();
t = "hs-pragma";
}
setState(ncomment(t, 1));
return null;
}
return "hs-special";
}
if (ch == '\'') {
if (source.next == '\\') {
source.next(); // should do more here
if (source.equals('\'')) {
source.next();
return "hs-char";
}
}
return "hs-error";
}
if (ch == '"') {
setState(stringLiteral);
return null;
}
if (largeRE.test(ch)) {
source.nextWhileMatches(idRE);
if (source.equals('.')) {
source.next();
return "hs-qualifier";
}
return "hs-conid";
}
if (smallRE.test(ch)) {
source.nextWhileMatches(idRE);
return "hs-varid";
}
if (digitRE.test(ch)) {
if (ch == '0') {
if (source.matches(/[xX]/)) {
source.next();
source.nextWhileMatches(hexitRE); // should require at least 1
return "hs-integer";
}
if (source.matches(/[oO]/)) {
source.next();
source.nextWhileMatches(octitRE); // should require at least 1
return "hs-integer";
}
}
source.nextWhileMatches(digitRE);
var t = "hs-integer";
if (source.equals('.')) {
t = "hs-float";
source.next();
source.nextWhileMatches(digitRE); // should require at least 1
}
if (source.matches(/[eE]/)) {
t = "hs-float";
source.next();
if (source.matches(/[-+]/)) {
source.next();
}
source.nextWhileMatches(digitRE); // should require at least 1
}
return t;
}
if (symbolRE.test(ch)) {
if (ch == '-' && source.matches(/-/)) {
source.nextWhileMatches(/-/);
if (!source.matches(symbolRE)) {
while (!source.endOfLine()) {
source.next();
}
return "hs-comment";
}
}
var t = "hs-varsym";
if (ch == ':') {
t = "hs-consym";
}
source.nextWhileMatches(symbolRE);
return t;
}
return "hs-error";
}
function ncomment(type, nest) {
if (nest == 0) {
return normal;
}
return function(source, setState) {
while (source.more() && !source.endOfLine()) {
ch = source.next();
if (ch == '{' && source.equals('-')) {
source.next();
setState(ncomment(type, nest+1));
return null;
}
else if (ch == '-' && source.equals('}')) {
source.next();
setState(ncomment(type, nest-1));
return (nest == 1) ? type : null;
}
}
return type;
}
}
function stringLiteral(source, setState) {
while (!source.endOfLine()) {
var ch = source.next();
if (ch == '"') {
setState(normal);
return "hs-string";
}
if (ch == '\\') {
if (source.endOfLine() || source.matches(whiteCharRE)) {
setState(stringGap);
return "hs-string";
}
if (source.equals('&')) {
source.next();
}
else {
source.next(); // could do more complicated matching here
}
}
}
setState(normal);
return "hs-error";
}
function stringGap(source, setState) {
if (source.equals('\\')) {
source.next();
setState(stringLiteral);
return null; //"hs-gap";
}
source.next();
setState(normal);
return "hs-error";
}
return function(source, state) {
return tokenizer(source, state || normal);
};
})();
var wellKnownWords = (function() {
var wkw = {};
function setType(t) {
return function () {
for (var i = 0; i < arguments.length; i++)
wkw[arguments[i]] = t;
}
}
setType("hs-reservedid")(
"case", "class", "data", "default", "deriving", "do", "else", "foreign",
"if", "import", "in", "infix", "infixl", "infixr", "instance", "let",
"module", "newtype", "of", "then", "type", "where", "_");
setType("hs-reservedop")(
"\.\.", ":", "::", "=", "\\", "\"", "<-", "->", "@", "~", "=>");
setType("hs-prelude-varsym")(
"!!", "$!", "$", "&&", "+", "++", "-", ".", "/", "/=", "<", "<=", "=<<",
"==", ">", ">=", ">>", ">>=", "^", "^^", "||", "*", "**");
setType("hs-prelude-conid")(
"Bool", "Bounded", "Char", "Double", "EQ", "Either", "Enum", "Eq",
"False", "FilePath", "Float", "Floating", "Fractional", "Functor", "GT",
"IO", "IOError", "Int", "Integer", "Integral", "Just", "LT", "Left",
"Maybe", "Monad", "Nothing", "Num", "Ord", "Ordering", "Rational", "Read",
"ReadS", "Real", "RealFloat", "RealFrac", "Right", "Show", "ShowS",
"String", "True");
setType("hs-prelude-varid")(
"abs", "acos", "acosh", "all", "and", "any", "appendFile", "asTypeOf",
"asin", "asinh", "atan", "atan2", "atanh", "break", "catch", "ceiling",
"compare", "concat", "concatMap", "const", "cos", "cosh", "curry",
"cycle", "decodeFloat", "div", "divMod", "drop", "dropWhile", "either",
"elem", "encodeFloat", "enumFrom", "enumFromThen", "enumFromThenTo",
"enumFromTo", "error", "even", "exp", "exponent", "fail", "filter",
"flip", "floatDigits", "floatRadix", "floatRange", "floor", "fmap",
"foldl", "foldl1", "foldr", "foldr1", "fromEnum", "fromInteger",
"fromIntegral", "fromRational", "fst", "gcd", "getChar", "getContents",
"getLine", "head", "id", "init", "interact", "ioError", "isDenormalized",
"isIEEE", "isInfinite", "isNaN", "isNegativeZero", "iterate", "last",
"lcm", "length", "lex", "lines", "log", "logBase", "lookup", "map",
"mapM", "mapM_", "max", "maxBound", "maximum", "maybe", "min", "minBound",
"minimum", "mod", "negate", "not", "notElem", "null", "odd", "or",
"otherwise", "pi", "pred", "print", "product", "properFraction",
"putChar", "putStr", "putStrLn", "quot", "quotRem", "read", "readFile",
"readIO", "readList", "readLn", "readParen", "reads", "readsPrec",
"realToFrac", "recip", "rem", "repeat", "replicate", "return", "reverse",
"round", "scaleFloat", "scanl", "scanl1", "scanr", "scanr1", "seq",
"sequence", "sequence_", "show", "showChar", "showList", "showParen",
"showString", "shows", "showsPrec", "significand", "signum", "sin",
"sinh", "snd", "span", "splitAt", "sqrt", "subtract", "succ", "sum",
"tail", "take", "takeWhile", "tan", "tanh", "toEnum", "toInteger",
"toRational", "truncate", "uncurry", "undefined", "unlines", "until",
"unwords", "unzip", "unzip3", "userError", "words", "writeFile", "zip",
"zip3", "zipWith", "zipWith3");
return wkw;
})()
function parseHaskell(source) {
function indentTo(n) {return function() {return n;}}
var tokens = tokenizeHaskell(source);
var space = 0;
var iter = {
next: function() {
var tok = tokens.next();
if (tok.type == "whitespace") {
if (tok.value == "\n") tok.indentation = indentTo(space);
else space = tok.value.length;
}
else if (tok.content in wellKnownWords) {
tok.style = wellKnownWords[tok.content];
}
return tok;
},
copy: function() {
var _space = space;
var _tokensState = tokens.state;
return function(_source) {
space = _space;
tokens = tokenizeHaskell(_source, _tokensState);
return iter;
};
}
};
return iter;
}
return {make: parseHaskell};
})();