Agda-2.5.1.2: A dependently typed functional programming language and proof assistant
Agda.Compiler.JS.Parser
type Parser = ReadP Char Source #
identifier :: Parser String Source #
wordBoundary :: Parser () Source #
token :: String -> Parser () Source #
punct :: Char -> Parser () Source #
parened :: Parser a -> Parser a Source #
braced :: Parser a -> Parser a Source #
bracketed :: Parser a -> Parser a Source #
quoted :: Parser a -> Parser a Source #
stringLit :: Parser Exp Source #
stringStr :: Parser String Source #
stringChr :: Parser Char Source #
escChr :: Parser Char Source #
intLit :: Parser Exp Source #
undef :: Parser Exp Source #
localid :: Map String Nat -> Parser Exp Source #
globalid :: Parser Exp Source #
preop :: Parser String Source #
binop :: Parser String Source #
field :: Map String Nat -> Parser (MemberId, Exp) Source #
object :: Map String Nat -> Parser Exp Source #
function :: Map String Nat -> Parser Exp Source #
bracedBlock :: Map String Nat -> Parser Exp Source #
returnBlock :: Map String Nat -> Parser Exp Source #
ifBlock :: Map String Nat -> Parser Exp Source #
exp0 :: Map String Nat -> Parser Exp Source #
exp1 :: Map String Nat -> Parser Exp Source #
exp2 :: Map String Nat -> Parser Exp Source #
exp2' :: Map String Nat -> Exp -> Parser Exp Source #
exp3 :: Map String Nat -> Parser Exp Source #
exp3' :: Map String Nat -> Exp -> Parser Exp Source #
exp :: Map String Nat -> Parser Exp Source #
topLevel :: Parser Exp Source #
parse :: String -> Either Exp String Source #