Yi.Syntax.Paren

Parser for Haskell that only cares about parenthesis and layout.

Documentation

indentScanner :: Scanner (AlexState lexState) TT -> Scanner (State Token lexState) TT

isBrace :: TT -> Bool

ignoredToken :: TT -> Bool

isNoise :: Token -> Bool

type Expr t = [Tree t]

data Tree t

Constructors

Paren t (Expr t) t

Block [Tree t]

Atom t

Error t

Expr [Tree t]

Instances

Functor Tree

Methods

fmap :: (a -> b) -> Tree a -> Tree b

(<$) :: a -> Tree b -> Tree a

Foldable Tree

Methods

fold :: Monoid m => Tree m -> m

foldMap :: Monoid m => (a -> m) -> Tree a -> m

foldr :: (a -> b -> b) -> b -> Tree a -> b

foldr' :: (a -> b -> b) -> b -> Tree a -> b

foldl :: (b -> a -> b) -> b -> Tree a -> b

foldl' :: (b -> a -> b) -> b -> Tree a -> b

foldr1 :: (a -> a -> a) -> Tree a -> a

foldl1 :: (a -> a -> a) -> Tree a -> a

toList :: Tree a -> [a]

null :: Tree a -> Bool

length :: Tree a -> Int

elem :: Eq a => a -> Tree a -> Bool

maximum :: Ord a => Tree a -> a

minimum :: Ord a => Tree a -> a

sum :: Num a => Tree a -> a

product :: Num a => Tree a -> a

IsTree Tree

Methods

subtrees :: Tree t -> [Tree t]

uniplate :: Tree t -> ([Tree t], [Tree t] -> Tree t)

emptyNode :: Tree t

Show t => Show (Tree t)

Methods

showsPrec :: Int -> Tree t -> ShowS

show :: Tree t -> String

showList :: [Tree t] -> ShowS

getIndentingSubtree :: Tree TT -> Point -> Int -> Maybe (Tree TT)

Search the given list, and return the 1st tree after the given point on the given line. This is the tree that will be moved if something is inserted at the point. Precondition: point is in the given line.

getSubtreeSpan :: Tree TT -> (Point, Int)

Given a tree, return (first offset, number of lines).

parse :: P TT (Tree TT)

parse' :: (TT -> Token) -> (Token -> TT) -> P TT [Tree TT]

getStrokes :: Point -> Point -> Point -> Tree TT -> [Stroke]

tokenToStroke :: TT -> Stroke

modStroke :: StyleName -> Stroke -> Stroke

tokenToAnnot :: TT -> Maybe (Span String)

errTok :: Parser (Tok t) (Tok Token)

Create a special error token. (e.g. fill in where there is no correct token to parse) Note that the position of the token has to be correct for correct computation of node spans.