Language.Symantic.Grammar.ContextFree

Symantics for context-free grammars.

Type CF

newtype CF g a

Context-free grammar.

Constructors

CF

Fields

• unCF :: g a

Instances

Gram_Error err g => Gram_Error err (CF g)

Methods

g_catch :: CF g (Either err a) -> CF g a

Gram_State st g => Gram_State st (CF g)

Methods

g_state_before :: CF g (st -> (st, a)) -> CF g a

g_state_after :: CF g (st -> (st, a)) -> CF g a

g_get_before :: CF g (st -> a) -> CF g a

g_get_after :: CF g (st -> a) -> CF g a

g_put :: CF g (st, a) -> CF g a

Gram_Reader st g => Gram_Reader st (CF g)

Methods

g_ask_before :: CF g (st -> a) -> CF g a

g_ask_after :: CF g (st -> a) -> CF g a

Functor g => Functor (CF g)

Methods

fmap :: (a -> b) -> CF g a -> CF g b

(<$) :: a -> CF g b -> CF g a

Applicative g => Applicative (CF g)

Methods

pure :: a -> CF g a

(<*>) :: CF g (a -> b) -> CF g a -> CF g b

(*>) :: CF g a -> CF g b -> CF g b

(<*) :: CF g a -> CF g b -> CF g a

Gram_RuleEBNF g => Gram_RuleEBNF (CF g)

Methods

ruleEBNF :: EBNF () -> CF g a -> RuleEBNF a

argEBNF :: Text -> CF g a

Gram_Rule g => Gram_Rule (CF g)

Methods

rule :: Text -> Rule (CF g a)

rule1 :: Text -> Rule (CF g a -> CF g b)

rule2 :: Text -> Rule (CF g a -> CF g b -> CF g c)

rule3 :: Text -> Rule (CF g a -> CF g b -> CF g c -> CF g d)

rule4 :: Text -> Rule (CF g a -> CF g b -> CF g c -> CF g d -> CF g e)

Gram_Terminal g => Gram_Terminal (CF g)

Methods

any :: CF g Char

but :: Terminal (CF g) Char -> Terminal (CF g) Char -> Terminal (CF g) Char

eoi :: CF g ()

char :: Char -> CF g Char

string :: String -> CF g String

unicat :: Unicat -> CF g Char

range :: (Char, Char) -> CF g Char

Gram_RegL g => Gram_RegL (CF g)

Methods

(<*.) :: RegL (CF g) (a -> b) -> Terminal (CF g) a -> RegL (CF g) b

manyL :: Terminal (CF g) a -> RegL (CF g) [a]

someL :: Terminal (CF g) a -> RegL (CF g) [a]

Gram_RegR g => Gram_RegR (CF g)

Methods

(.*>) :: Terminal (CF g) (a -> b) -> RegR (CF g) a -> RegR (CF g) b

manyR :: Terminal (CF g) a -> RegR (CF g) [a]

someR :: Terminal (CF g) a -> RegR (CF g) [a]

Gram_Try g => Gram_Try (CF g)

Methods

try :: CF g a -> CF g a

Gram_Alt g => Gram_Alt (CF g)

Methods

empty :: CF g a

(<+>) :: CF g a -> CF g a -> CF g a

choice :: [CF g a] -> CF g a

Gram_Comment g => Gram_Comment (CF g)

Methods

commentable :: CF g () -> CF g () -> CF g () -> CF g ()

comment_line :: CF (CF g) String -> CF (CF g) String

comment_block :: CF (CF g) String -> Reg lr (CF g) String -> CF (CF g) String

lexeme :: CF (CF g) a -> CF (CF g) a

parens :: CF (CF g) a -> CF (CF g) a

symbol :: String -> CF (CF g) String

Gram_AltApp g => Gram_AltApp (CF g)

Methods

option :: a -> CF g a -> CF g a

optional :: CF g a -> CF g (Maybe a)

many :: CF g a -> CF g [a]

some :: CF g a -> CF g [a]

skipMany :: CF g a -> CF g ()

inside :: (in_ -> next) -> CF (CF g) begin -> CF (CF g) in_ -> CF (CF g) end -> CF (CF g) next -> CF (CF g) next

Gram_App g => Gram_App (CF g)

Methods

between :: CF g open -> CF g close -> CF g a -> CF g a

Gram_CF g => Gram_CF (CF g)

Methods

(<&) :: CF (CF g) (a -> b) -> Reg lr (CF g) a -> CF (CF g) b

(&>) :: Reg lr (CF g) (a -> b) -> CF (CF g) a -> CF (CF g) b

minus :: CF (CF g) a -> Reg lr (CF g) b -> CF (CF g) a

Gram_Op g => Gram_Op (CF g)

Methods

operators :: CF (CF g) a -> CF (CF g) (Unifix, a -> a) -> CF (CF g) (Infix, a -> a -> a) -> CF (CF g) (Unifix, a -> a) -> CF (CF g) (Either Error_Fixity a)

infixrG :: CF (CF g) a -> CF (CF g) (a -> a -> a) -> CF (CF g) a

infixlG :: CF (CF g) a -> CF (CF g) (a -> a -> a) -> CF (CF g) a

IsString (g a) => IsString (CF g a)

Methods

fromString :: String -> CF g a

cf_of_Terminal :: Terminal g a -> CF g a

cf_of_Reg :: Reg lr g a -> CF g a

Class Gram_CF

class Gram_CF g where

Symantics for context-free grammars.

Minimal complete definition

(<&), (&>), minus

Methods

(<&) :: CF g (a -> b) -> Reg lr g a -> CF g b infixl 4

NOTE: CFL ∩ RL is a CFL. See ISBN 81-7808-347-7, Theorem 7.27, p.286

(&>) :: Reg lr g (a -> b) -> CF g a -> CF g b infixl 4

minus :: CF g a -> Reg lr g b -> CF g a

NOTE: CFL - RL is a CFL. See ISBN 81-7808-347-7, Theorem 7.29, p.289

Instances

Gram_CF RuleEBNF

Methods

(<&) :: CF RuleEBNF (a -> b) -> Reg lr RuleEBNF a -> CF RuleEBNF b

(&>) :: Reg lr RuleEBNF (a -> b) -> CF RuleEBNF a -> CF RuleEBNF b

minus :: CF RuleEBNF a -> Reg lr RuleEBNF b -> CF RuleEBNF a

Gram_CF EBNF

Methods

(<&) :: CF EBNF (a -> b) -> Reg lr EBNF a -> CF EBNF b

(&>) :: Reg lr EBNF (a -> b) -> CF EBNF a -> CF EBNF b

minus :: CF EBNF a -> Reg lr EBNF b -> CF EBNF a

Gram_CF g => Gram_CF (CF g)

Methods

(<&) :: CF (CF g) (a -> b) -> Reg lr (CF g) a -> CF (CF g) b

(&>) :: Reg lr (CF g) (a -> b) -> CF (CF g) a -> CF (CF g) b

minus :: CF (CF g) a -> Reg lr (CF g) b -> CF (CF g) a

Class Gram_App

class Applicative g => Gram_App g where

Methods

between :: g open -> g close -> g a -> g a

Instances

Gram_App RuleEBNF

Methods

between :: RuleEBNF open -> RuleEBNF close -> RuleEBNF a -> RuleEBNF a

Gram_App EBNF

Methods

between :: EBNF open -> EBNF close -> EBNF a -> EBNF a

Gram_App g => Gram_App (CF g)

Methods

between :: CF g open -> CF g close -> CF g a -> CF g a

Class Gram_AltApp

class (Gram_Alt g, Gram_App g) => Gram_AltApp g where

Symantics when Gram_Alt and Gram_App are allowed by the grammar.

Methods

option :: a -> g a -> g a

optional :: g a -> g (Maybe a)

many :: g a -> g [a]

some :: g a -> g [a]

skipMany :: g a -> g ()

inside :: (in_ -> next) -> CF g begin -> CF g in_ -> CF g end -> CF g next -> CF g next

Instances

Gram_AltApp RuleEBNF

Methods

option :: a -> RuleEBNF a -> RuleEBNF a

optional :: RuleEBNF a -> RuleEBNF (Maybe a)

many :: RuleEBNF a -> RuleEBNF [a]

some :: RuleEBNF a -> RuleEBNF [a]

skipMany :: RuleEBNF a -> RuleEBNF ()

inside :: (in_ -> next) -> CF RuleEBNF begin -> CF RuleEBNF in_ -> CF RuleEBNF end -> CF RuleEBNF next -> CF RuleEBNF next

Gram_AltApp EBNF

Methods

option :: a -> EBNF a -> EBNF a

optional :: EBNF a -> EBNF (Maybe a)

many :: EBNF a -> EBNF [a]

some :: EBNF a -> EBNF [a]

skipMany :: EBNF a -> EBNF ()

inside :: (in_ -> next) -> CF EBNF begin -> CF EBNF in_ -> CF EBNF end -> CF EBNF next -> CF EBNF next

Gram_AltApp g => Gram_AltApp (CF g)

Methods

option :: a -> CF g a -> CF g a

optional :: CF g a -> CF g (Maybe a)

many :: CF g a -> CF g [a]

some :: CF g a -> CF g [a]

skipMany :: CF g a -> CF g ()

inside :: (in_ -> next) -> CF (CF g) begin -> CF (CF g) in_ -> CF (CF g) end -> CF (CF g) next -> CF (CF g) next

Class Gram_Comment

class (Gram_Terminal g, Gram_Rule g, Gram_Alt g, Gram_App g, Gram_AltApp g, Gram_CF g) => Gram_Comment g where

Symantics for handling comments after each lexeme.

Methods

commentable :: g () -> g () -> g () -> g ()

comment_line :: CF g String -> CF g String

comment_block :: CF g String -> Reg lr g String -> CF g String

lexeme :: CF g a -> CF g a

parens :: CF g a -> CF g a

symbol :: String -> CF g String

Instances

Gram_Comment RuleEBNF

Methods

commentable :: RuleEBNF () -> RuleEBNF () -> RuleEBNF () -> RuleEBNF ()

comment_line :: CF RuleEBNF String -> CF RuleEBNF String

comment_block :: CF RuleEBNF String -> Reg lr RuleEBNF String -> CF RuleEBNF String

lexeme :: CF RuleEBNF a -> CF RuleEBNF a

parens :: CF RuleEBNF a -> CF RuleEBNF a

symbol :: String -> CF RuleEBNF String

Gram_Comment EBNF

Methods

commentable :: EBNF () -> EBNF () -> EBNF () -> EBNF ()

comment_line :: CF EBNF String -> CF EBNF String

comment_block :: CF EBNF String -> Reg lr EBNF String -> CF EBNF String

lexeme :: CF EBNF a -> CF EBNF a

parens :: CF EBNF a -> CF EBNF a

symbol :: String -> CF EBNF String

Gram_Comment g => Gram_Comment (CF g)

Methods

commentable :: CF g () -> CF g () -> CF g () -> CF g ()

comment_line :: CF (CF g) String -> CF (CF g) String

comment_block :: CF (CF g) String -> Reg lr (CF g) String -> CF (CF g) String

lexeme :: CF (CF g) a -> CF (CF g) a

parens :: CF (CF g) a -> CF (CF g) a

symbol :: String -> CF (CF g) String

gram_comment :: forall g. (Gram_Comment g, Gram_RuleEBNF g) => [CF g ()]