Swarm.Language.Parser.Term

Parser for terms of the Swarm language.

Documentation

>>> import qualified Data.Map.Strict as M

parseDirection :: Parser Direction

parseConst :: Parser Const

Parse Const as reserved words (e.g. Fail <$ reserved "fail")

parseTermAtom :: Parser Syntax

Parse an atomic term, optionally trailed by record projections like t.x.y.z. Record projection binds more tightly than function application.

parseTermAtom2 :: Parser Syntax

Parse an atomic term.

sLet :: LetSyntax -> LocVar -> Maybe Polytype -> Syntax -> Syntax -> Term

Construct an SLet, automatically filling in the Boolean field indicating whether it is recursive.

sNoop :: Syntax

bindTydef :: [Var] -> Type -> Parser Polytype

Create a polytype from a list of variable binders and a type. Ensure that no binder is repeated, and all type variables in the type are present in the list of binders (i.e. the type contains no free type variables).

parseAntiquotation :: Parser Term

parseTerm :: Parser Syntax

Parse a Swarm language term.

mkBindChain :: [Stmt] -> Parser Syntax

data Stmt

Constructors

BareTerm Syntax

Binder LocVar Syntax

Instances

Show Stmt

Defined in Swarm.Language.Parser.Term

Methods

showsPrec :: Int -> Stmt -> ShowS

show :: Stmt -> String

showList :: [Stmt] -> ShowS

parseStmt :: Parser Stmt

mkStmt :: Maybe LocVar -> Syntax -> Stmt

parseExpr :: Parser Syntax

parseExpr' :: Parser Syntax

binOps :: Map Int [Operator Parser Syntax]

Precedences and parsers of binary operators.

>>> M.map length binOps
fromList [(0,1),(2,1),(3,1),(4,6),(6,3),(7,2),(8,1)]

unOps :: Map Int [Operator Parser Syntax]

Precedences and parsers of unary operators (currently only Neg).

>>> M.map length unOps
fromList [(7,1)]