Safe Haskell	None
Language	Haskell2010

Language.Modula2.Grammar

Description

Modula-2 grammar adapted from ''Report on the Programming Language Modula-2''

Synopsis

type NodeWrap = (,) (Position, ParsedLexemes, Position)
data Modula2Grammar l f p = Modula2Grammar {
- ident :: p Ident
- number :: p (Value l l f f)
- integer :: p (Value l l f f)
- real :: p (Value l l f f)
- scaleFactor :: p Text
- hexDigit :: p Text
- digit :: p Text
- octalDigit :: p Text
- string_prod :: p Text
- qualident :: p (QualIdent l)
- constantDeclaration :: p (Declaration l l f f)
- constantDefinition :: p (Definition l l f f)
- constExpression :: p (NodeWrap (ConstExpression l l f f))
- relation :: p RelOp
- addOperator :: p (f (Expression l l f f) -> f (Expression l l f f) -> Expression l l f f)
- mulOperator :: p (f (Expression l l f f) -> f (Expression l l f f) -> Expression l l f f)
- set :: p (Expression l l f f)
- element :: p (Element l l f f)
- typeDeclaration :: p (Declaration l l f f)
- typeDefinition :: p (Definition l l f f)
- type_prod :: p (Type l l f f)
- simpleType :: p (Type l l f f)
- enumeration :: p (Type l l f f)
- identList :: p (IdentList l)
- subrangeType :: p (Type l l f f)
- arrayType :: p (Type l l f f)
- recordType :: p (Type l l f f)
- fieldListSequence :: p [f (FieldList l l f f)]
- fieldList :: p (FieldList l l f f)
- variant :: p (Variant l l f f)
- caseLabelList :: p (NonEmpty (f (CaseLabels l l f f)))
- caseLabels :: p (CaseLabels l l f f)
- setType :: p (Type l l f f)
- pointerType :: p (Type l l f f)
- procedureType :: p (Type l l f f)
- formalTypeList :: p (FormalParameters l l f f)
- variableDeclaration :: p (Declaration l l f f)
- variableDefinition :: p (Definition l l f f)
- designator :: p (Designator l l f f)
- expList :: p (NonEmpty (f (Expression l l f f)))
- expression :: p (NodeWrap (Expression l l f f))
- simpleExpression :: p (NodeWrap (Expression l l f f))
- term :: p (NodeWrap (Expression l l f f))
- factor :: p (NodeWrap (Expression l l f f))
- actualParameters :: p [f (Expression l l f f)]
- statement :: p (Statement l l f f)
- assignment :: p (Statement l l f f)
- procedureCall :: p (Statement l l f f)
- statementSequence :: p (NodeWrap (StatementSequence l l f f))
- ifStatement :: p (Statement l l f f)
- caseStatement :: p (Statement l l f f)
- case_prod :: p (Case l l f f)
- whileStatement :: p (Statement l l f f)
- repeatStatement :: p (Statement l l f f)
- forStatement :: p (Statement l l f f)
- loopStatement :: p (Statement l l f f)
- withStatement :: p (Statement l l f f)
- procedureDeclaration :: p (Declaration l l f f)
- procedureHeading :: p (Ident, ProcedureHeading l l f f)
- block :: p (Block l l f f)
- declarationSequence :: p [f (Declaration l l f f)]
- formalParameters :: p (FormalParameters l l f f)
- fPSection :: p (FPSection l l f f)
- formalType :: p (Type l l f f)
- moduleDeclaration :: p (Declaration l l f f)
- priority :: p (NodeWrap (Priority l l f f))
- export :: p (Export l)
- import_prod :: p (Import l)
- definitionModule :: p (Module l l f f)
- definitionSequence :: p [f (Definition l l f f)]
- programModule :: p (Module l l f f)
- compilationUnit :: p (NodeWrap (Module l l f f))
}
type Parser = ParserT ((,) [[Lexeme]])
modula2grammar :: Grammar (Modula2Grammar Language NodeWrap) Parser Text
grammar :: forall l g. (Modula2 l, LexicalParsing (Parser g Text)) => GrammarBuilder (Modula2Grammar l NodeWrap) g Parser Text
comment :: Parser g Text Text
whiteSpace :: LexicalParsing (Parser g Text) => Parser g Text ()
wrap :: Parser g Text a -> Parser g Text (NodeWrap a)
moptional :: (Alternative f, Monoid (f a)) => f a -> f a
delimiter :: LexicalParsing (Parser g Text) => Text -> Parser g Text ()
operator :: LexicalParsing (Parser g Text) => Text -> Parser g Text ()
reservedWords :: [Text]
data Lexeme
- = WhiteSpace {
  - lexemeText :: Text
  }
- | Comment {
  - lexemeText :: Text
  }
- | Token {
  - lexemeType :: TokenType
  - lexemeText :: Text
  }
newtype ParsedLexemes = Trailing [Lexeme]

Documentation

type NodeWrap = (,) (Position, ParsedLexemes, Position) Source #

data Modula2Grammar l f p Source #

The names and types of all the Modula-2 grammar productions

Constructors

Modula2Grammar

Fields

ident :: p Ident
number :: p (Value l l f f)
integer :: p (Value l l f f)
real :: p (Value l l f f)
scaleFactor :: p Text
hexDigit :: p Text
digit :: p Text
octalDigit :: p Text
string_prod :: p Text
qualident :: p (QualIdent l)
constantDeclaration :: p (Declaration l l f f)
constantDefinition :: p (Definition l l f f)
constExpression :: p (NodeWrap (ConstExpression l l f f))
relation :: p RelOp
addOperator :: p (f (Expression l l f f) -> f (Expression l l f f) -> Expression l l f f)
mulOperator :: p (f (Expression l l f f) -> f (Expression l l f f) -> Expression l l f f)
set :: p (Expression l l f f)
element :: p (Element l l f f)
typeDeclaration :: p (Declaration l l f f)
typeDefinition :: p (Definition l l f f)
type_prod :: p (Type l l f f)
simpleType :: p (Type l l f f)
enumeration :: p (Type l l f f)
identList :: p (IdentList l)
subrangeType :: p (Type l l f f)
arrayType :: p (Type l l f f)
recordType :: p (Type l l f f)
fieldListSequence :: p [f (FieldList l l f f)]
fieldList :: p (FieldList l l f f)
variant :: p (Variant l l f f)
caseLabelList :: p (NonEmpty (f (CaseLabels l l f f)))
caseLabels :: p (CaseLabels l l f f)
setType :: p (Type l l f f)
pointerType :: p (Type l l f f)
procedureType :: p (Type l l f f)
formalTypeList :: p (FormalParameters l l f f)
variableDeclaration :: p (Declaration l l f f)
variableDefinition :: p (Definition l l f f)
designator :: p (Designator l l f f)
expList :: p (NonEmpty (f (Expression l l f f)))
expression :: p (NodeWrap (Expression l l f f))
simpleExpression :: p (NodeWrap (Expression l l f f))
term :: p (NodeWrap (Expression l l f f))
factor :: p (NodeWrap (Expression l l f f))
actualParameters :: p [f (Expression l l f f)]
statement :: p (Statement l l f f)
assignment :: p (Statement l l f f)
procedureCall :: p (Statement l l f f)
statementSequence :: p (NodeWrap (StatementSequence l l f f))
ifStatement :: p (Statement l l f f)
caseStatement :: p (Statement l l f f)
case_prod :: p (Case l l f f)
whileStatement :: p (Statement l l f f)
repeatStatement :: p (Statement l l f f)
forStatement :: p (Statement l l f f)
loopStatement :: p (Statement l l f f)
withStatement :: p (Statement l l f f)
procedureDeclaration :: p (Declaration l l f f)
procedureHeading :: p (Ident, ProcedureHeading l l f f)
block :: p (Block l l f f)
declarationSequence :: p [f (Declaration l l f f)]
formalParameters :: p (FormalParameters l l f f)
fPSection :: p (FPSection l l f f)
formalType :: p (Type l l f f)
moduleDeclaration :: p (Declaration l l f f)
priority :: p (NodeWrap (Priority l l f f))
export :: p (Export l)
import_prod :: p (Import l)
definitionModule :: p (Module l l f f)
definitionSequence :: p [f (Definition l l f f)]
programModule :: p (Module l l f f)
compilationUnit :: p (NodeWrap (Module l l f f))

Instances

Instances details

Functor (Modula2Grammar l f :: (Type -> Type) -> Type) Source #
Instance details Defined in Language.Modula2.Grammar Methods (<$>) :: (forall (a :: k). p a -> q a) -> Modula2Grammar l f p -> Modula2Grammar l f q #
Foldable (Modula2Grammar l f :: (Type -> Type) -> Type) Source #
Instance details Defined in Language.Modula2.Grammar Methods foldMap :: Monoid m => (forall (a :: k). p a -> m) -> Modula2Grammar l f p -> m #
Traversable (Modula2Grammar l f :: (Type -> Type) -> Type) Source #
Instance details Defined in Language.Modula2.Grammar Methods traverse :: Applicative m => (forall (a :: k). p a -> m (q a)) -> Modula2Grammar l f p -> m (Modula2Grammar l f q) # sequence :: forall m (p :: k -> Type). Applicative m => Modula2Grammar l f (Compose m p) -> m (Modula2Grammar l f p) #
Apply (Modula2Grammar l f :: (Type -> Type) -> Type) Source #
Instance details Defined in Language.Modula2.Grammar Methods (<*>) :: forall (p :: k -> Type) (q :: k -> Type). Modula2Grammar l f (p ~> q) -> Modula2Grammar l f p -> Modula2Grammar l f q # liftA2 :: (forall (a :: k). p a -> q a -> r a) -> Modula2Grammar l f p -> Modula2Grammar l f q -> Modula2Grammar l f r # liftA3 :: (forall (a :: k). p a -> q a -> r a -> s a) -> Modula2Grammar l f p -> Modula2Grammar l f q -> Modula2Grammar l f r -> Modula2Grammar l f s #
Applicative (Modula2Grammar l f :: (Type -> Type) -> Type) Source #
Instance details Defined in Language.Modula2.Grammar Methods pure :: (forall (a :: k). f0 a) -> Modula2Grammar l f f0 #
Distributive (Modula2Grammar l f :: (Type -> Type) -> Type) Source #
Instance details Defined in Language.Modula2.Grammar Methods collect :: forall f1 a (f2 :: k -> Type). Functor f1 => (a -> Modula2Grammar l f f2) -> f1 a -> Modula2Grammar l f (Compose f1 f2) # distribute :: forall f1 (f2 :: k -> Type). Functor f1 => f1 (Modula2Grammar l f f2) -> Modula2Grammar l f (Compose f1 f2) # cotraverse :: Functor m => (forall (a :: k). m (p a) -> q a) -> m (Modula2Grammar l f p) -> Modula2Grammar l f q #
DistributiveTraversable (Modula2Grammar l f :: (Type -> Type) -> Type) Source #
Instance details Defined in Language.Modula2.Grammar Methods collectTraversable :: forall f1 a (f2 :: k -> Type). Traversable f1 => (a -> Modula2Grammar l f f2) -> f1 a -> Modula2Grammar l f (Compose f1 f2) # distributeTraversable :: forall f1 (f2 :: k -> Type). Traversable f1 => f1 (Modula2Grammar l f f2) -> Modula2Grammar l f (Compose f1 f2) # cotraverseTraversable :: Traversable f1 => (forall (x :: k). f1 (f2 x) -> f0 x) -> f1 (Modula2Grammar l f f2) -> Modula2Grammar l f f0 #
LexicalParsing (Parser (Modula2Grammar l f) Text) Source #
Instance details Defined in Language.Modula2.Grammar Methods lexicalWhiteSpace :: Parser (Modula2Grammar l f) Text () # someLexicalSpace :: Parser (Modula2Grammar l f) Text () # lexicalComment :: Parser (Modula2Grammar l f) Text () # lexicalSemicolon :: Parser (Modula2Grammar l f) Text Char # lexicalToken :: Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a # identifierToken :: Parser (Modula2Grammar l f) Text (ParserInput (Parser (Modula2Grammar l f) Text)) -> Parser (Modula2Grammar l f) Text (ParserInput (Parser (Modula2Grammar l f) Text)) # isIdentifierStartChar :: Char -> Bool # isIdentifierFollowChar :: Char -> Bool # identifier :: Parser (Modula2Grammar l f) Text (ParserInput (Parser (Modula2Grammar l f) Text)) # keyword :: ParserInput (Parser (Modula2Grammar l f) Text) -> Parser (Modula2Grammar l f) Text () #
LexicalParsing (Parser (ISOGrammar l) Text) Source #
Instance details Defined in Language.Modula2.ISO.Grammar Methods lexicalWhiteSpace :: Parser (ISOGrammar l) Text () # someLexicalSpace :: Parser (ISOGrammar l) Text () # lexicalComment :: Parser (ISOGrammar l) Text () # lexicalSemicolon :: Parser (ISOGrammar l) Text Char # lexicalToken :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # identifierToken :: Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) -> Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) # isIdentifierStartChar :: Char -> Bool # isIdentifierFollowChar :: Char -> Bool # identifier :: Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) # keyword :: ParserInput (Parser (ISOGrammar l) Text) -> Parser (ISOGrammar l) Text () #
TokenParsing (Parser (Modula2Grammar l f) Text) Source #
Instance details Defined in Language.Modula2.Grammar Methods someSpace :: Parser (Modula2Grammar l f) Text () # nesting :: Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a # semi :: Parser (Modula2Grammar l f) Text Char # highlight :: Highlight -> Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a # token :: Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a #
TokenParsing (Parser (ISOGrammar l) Text) Source #
Instance details Defined in Language.Modula2.ISO.Grammar Methods someSpace :: Parser (ISOGrammar l) Text () # nesting :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # semi :: Parser (ISOGrammar l) Text Char # highlight :: Highlight -> Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # token :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a #

type Parser = ParserT ((,) [[Lexeme]]) Source #

modula2grammar :: Grammar (Modula2Grammar Language NodeWrap) Parser Text Source #

grammar :: forall l g. (Modula2 l, LexicalParsing (Parser g Text)) => GrammarBuilder (Modula2Grammar l NodeWrap) g Parser Text Source #

All the productions of Modula-2 grammar

comment :: Parser g Text Text Source #

whiteSpace :: LexicalParsing (Parser g Text) => Parser g Text () Source #

wrap :: Parser g Text a -> Parser g Text (NodeWrap a) Source #

moptional :: (Alternative f, Monoid (f a)) => f a -> f a Source #

delimiter :: LexicalParsing (Parser g Text) => Text -> Parser g Text () Source #

operator :: LexicalParsing (Parser g Text) => Text -> Parser g Text () Source #

reservedWords :: [Text] Source #

data Lexeme #

Constructors

WhiteSpace
Fields lexemeText :: Text
Comment
Fields lexemeText :: Text
Token
Fields lexemeType :: TokenType lexemeText :: Text

Instances

Instances details

Eq Lexeme
Instance details Defined in Language.Oberon.Grammar Methods (==) :: Lexeme -> Lexeme -> Bool # (/=) :: Lexeme -> Lexeme -> Bool #
Data Lexeme
Instance details Defined in Language.Oberon.Grammar Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Lexeme -> c Lexeme # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Lexeme # toConstr :: Lexeme -> Constr # dataTypeOf :: Lexeme -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Lexeme) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Lexeme) # gmapT :: (forall b. Data b => b -> b) -> Lexeme -> Lexeme # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Lexeme -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Lexeme -> r # gmapQ :: (forall d. Data d => d -> u) -> Lexeme -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Lexeme -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Lexeme -> m Lexeme # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Lexeme -> m Lexeme # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Lexeme -> m Lexeme #
Show Lexeme
Instance details Defined in Language.Oberon.Grammar Methods showsPrec :: Int -> Lexeme -> ShowS # show :: Lexeme -> String # showList :: [Lexeme] -> ShowS #
LexicalParsing (Parser (OberonGrammar l f) Text)
Instance details Defined in Language.Oberon.Grammar Methods lexicalWhiteSpace :: Parser (OberonGrammar l f) Text () # someLexicalSpace :: Parser (OberonGrammar l f) Text () # lexicalComment :: Parser (OberonGrammar l f) Text () # lexicalSemicolon :: Parser (OberonGrammar l f) Text Char # lexicalToken :: Parser (OberonGrammar l f) Text a -> Parser (OberonGrammar l f) Text a # identifierToken :: Parser (OberonGrammar l f) Text (ParserInput (Parser (OberonGrammar l f) Text)) -> Parser (OberonGrammar l f) Text (ParserInput (Parser (OberonGrammar l f) Text)) # isIdentifierStartChar :: Char -> Bool # isIdentifierFollowChar :: Char -> Bool # identifier :: Parser (OberonGrammar l f) Text (ParserInput (Parser (OberonGrammar l f) Text)) # keyword :: ParserInput (Parser (OberonGrammar l f) Text) -> Parser (OberonGrammar l f) Text () #
LexicalParsing (Parser (Modula2Grammar l f) Text) Source #
Instance details Defined in Language.Modula2.Grammar Methods lexicalWhiteSpace :: Parser (Modula2Grammar l f) Text () # someLexicalSpace :: Parser (Modula2Grammar l f) Text () # lexicalComment :: Parser (Modula2Grammar l f) Text () # lexicalSemicolon :: Parser (Modula2Grammar l f) Text Char # lexicalToken :: Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a # identifierToken :: Parser (Modula2Grammar l f) Text (ParserInput (Parser (Modula2Grammar l f) Text)) -> Parser (Modula2Grammar l f) Text (ParserInput (Parser (Modula2Grammar l f) Text)) # isIdentifierStartChar :: Char -> Bool # isIdentifierFollowChar :: Char -> Bool # identifier :: Parser (Modula2Grammar l f) Text (ParserInput (Parser (Modula2Grammar l f) Text)) # keyword :: ParserInput (Parser (Modula2Grammar l f) Text) -> Parser (Modula2Grammar l f) Text () #
LexicalParsing (Parser (ISOGrammar l) Text) Source #
Instance details Defined in Language.Modula2.ISO.Grammar Methods lexicalWhiteSpace :: Parser (ISOGrammar l) Text () # someLexicalSpace :: Parser (ISOGrammar l) Text () # lexicalComment :: Parser (ISOGrammar l) Text () # lexicalSemicolon :: Parser (ISOGrammar l) Text Char # lexicalToken :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # identifierToken :: Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) -> Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) # isIdentifierStartChar :: Char -> Bool # isIdentifierFollowChar :: Char -> Bool # identifier :: Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) # keyword :: ParserInput (Parser (ISOGrammar l) Text) -> Parser (ISOGrammar l) Text () #
TokenParsing (Parser (OberonGrammar l f) Text)
Instance details Defined in Language.Oberon.Grammar Methods someSpace :: Parser (OberonGrammar l f) Text () # nesting :: Parser (OberonGrammar l f) Text a -> Parser (OberonGrammar l f) Text a # semi :: Parser (OberonGrammar l f) Text Char # highlight :: Highlight -> Parser (OberonGrammar l f) Text a -> Parser (OberonGrammar l f) Text a # token :: Parser (OberonGrammar l f) Text a -> Parser (OberonGrammar l f) Text a #
TokenParsing (Parser (Modula2Grammar l f) Text) Source #
Instance details Defined in Language.Modula2.Grammar Methods someSpace :: Parser (Modula2Grammar l f) Text () # nesting :: Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a # semi :: Parser (Modula2Grammar l f) Text Char # highlight :: Highlight -> Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a # token :: Parser (Modula2Grammar l f) Text a -> Parser (Modula2Grammar l f) Text a #
TokenParsing (Parser (ISOGrammar l) Text) Source #
Instance details Defined in Language.Modula2.ISO.Grammar Methods someSpace :: Parser (ISOGrammar l) Text () # nesting :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # semi :: Parser (ISOGrammar l) Text Char # highlight :: Highlight -> Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # token :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a #

newtype ParsedLexemes #

Constructors

Trailing [Lexeme]

Instances

Instances details

Data ParsedLexemes
Instance details Defined in Language.Oberon.Grammar Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ParsedLexemes -> c ParsedLexemes # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ParsedLexemes # toConstr :: ParsedLexemes -> Constr # dataTypeOf :: ParsedLexemes -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ParsedLexemes) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ParsedLexemes) # gmapT :: (forall b. Data b => b -> b) -> ParsedLexemes -> ParsedLexemes # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ParsedLexemes -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ParsedLexemes -> r # gmapQ :: (forall d. Data d => d -> u) -> ParsedLexemes -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ParsedLexemes -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ParsedLexemes -> m ParsedLexemes # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ParsedLexemes -> m ParsedLexemes # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ParsedLexemes -> m ParsedLexemes #
Show ParsedLexemes
Instance details Defined in Language.Oberon.Grammar Methods showsPrec :: Int -> ParsedLexemes -> ShowS # show :: ParsedLexemes -> String # showList :: [ParsedLexemes] -> ShowS #
Semigroup ParsedLexemes
Instance details Defined in Language.Oberon.Grammar Methods (<>) :: ParsedLexemes -> ParsedLexemes -> ParsedLexemes # sconcat :: NonEmpty ParsedLexemes -> ParsedLexemes # stimes :: Integral b => b -> ParsedLexemes -> ParsedLexemes #
Monoid ParsedLexemes
Instance details Defined in Language.Oberon.Grammar Methods mempty :: ParsedLexemes # mappend :: ParsedLexemes -> ParsedLexemes -> ParsedLexemes # mconcat :: [ParsedLexemes] -> ParsedLexemes #
(Ord (QualIdent l), v ~ Value l l Placed Placed) => SynthesizedField "designatorValue" (Maybe (Placed v)) (Auto ConstantFold) (Designator l l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods synthesizedField :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Proxy "designatorValue" -> Auto ConstantFold -> Placed (Designator l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Designator l l sem sem) -> Designator l l sem (Synthesized (Auto ConstantFold)) -> Maybe (Placed v) #
At Serialization (g Parsed Parsed)
Instance details Defined in Language.Oberon.Reserializer Methods ($) :: Serialization -> Domain Serialization (g Parsed Parsed) -> Codomain Serialization (g Parsed Parsed) #
(Foldable (g (Const (Sum Int) :: Type -> Type)), Foldable (Fold Parsed (Sum Int)) g) => At PositionAdjustment (g Parsed Parsed)
Instance details Defined in Language.Oberon.Reserializer Methods ($) :: PositionAdjustment -> Domain PositionAdjustment (g Parsed Parsed) -> Codomain PositionAdjustment (g Parsed Parsed) #
(Nameable l, k ~ QualIdent l, v ~ Value l l Placed Placed, Ord k, Atts (Synthesized (Auto ConstantFold)) (Declaration l l Sem Sem) ~ SynCFMod' l (Declaration l l)) => SynthesizedField "moduleEnv" (Map k (Maybe v)) (Auto ConstantFold) (Block l l) Sem Placed Source #
Instance details Defined in Language.Modula2.ISO.ConstantFolder Methods synthesizedField :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Proxy "moduleEnv" -> Auto ConstantFold -> Placed (Block l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Block l l sem sem) -> Block l l sem (Synthesized (Auto ConstantFold)) -> Map k (Maybe v) #
(Nameable l, k ~ QualIdent l, v ~ Value l l Placed Placed, Ord k, Atts (Synthesized (Auto ConstantFold)) (Declaration l l Sem Sem) ~ SynCFMod' l (Declaration l l)) => SynthesizedField "moduleEnv" (Map k (Maybe v)) (Auto ConstantFold) (Block l l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods synthesizedField :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Proxy "moduleEnv" -> Auto ConstantFold -> Placed (Block l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Block l l sem sem) -> Block l l sem (Synthesized (Auto ConstantFold)) -> Map k (Maybe v) #
(Nameable l, k ~ QualIdent l, v ~ Value l l Placed Placed, Ord k, Atts (Synthesized (Auto ConstantFold)) (ConstExpression l l Sem Sem) ~ SynCFExp l l) => SynthesizedField "moduleEnv" (Map k (Maybe v)) (Auto ConstantFold) (Declaration l l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods synthesizedField :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Proxy "moduleEnv" -> Auto ConstantFold -> Placed (Declaration l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Declaration l l sem sem) -> Declaration l l sem (Synthesized (Auto ConstantFold)) -> Map k (Maybe v) #
(Modula2 l, Nameable l, k ~ QualIdent l, Ord k, v ~ Value l l Placed Placed, Export l ~ Export l, Value l ~ Value l, Atts (Synthesized (Auto ConstantFold)) (Declaration l l Sem Sem) ~ SynCFMod' l (Declaration l l), Atts (Synthesized (Auto ConstantFold)) (Type l l Sem Sem) ~ SynCF' (Type l l), Atts (Synthesized (Auto ConstantFold)) (ProcedureHeading l l Sem Sem) ~ SynCF' (ProcedureHeading l l), Atts (Synthesized (Auto ConstantFold)) (FormalParameters l l Sem Sem) ~ SynCF' (FormalParameters l l), Atts (Synthesized (Auto ConstantFold)) (Block l l Sem Sem) ~ SynCFMod' l (Block l l), Atts (Synthesized (Auto ConstantFold)) (ConstExpression l l Sem Sem) ~ SynCFExp l l) => SynthesizedField "moduleEnv" (Map k (Maybe v)) (Auto ConstantFold) (Declaration full l l) Sem Placed Source #
Instance details Defined in Language.Modula2.ISO.ConstantFolder Methods synthesizedField :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Proxy "moduleEnv" -> Auto ConstantFold -> Placed (Declaration full l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Declaration full l l sem sem) -> Declaration full l l sem (Synthesized (Auto ConstantFold)) -> Map k (Maybe v) #
Ord (QualIdent l) => Bequether (Auto ConstantFold) (Modules l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods bequest :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Auto ConstantFold -> Placed (Modules l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Modules l sem sem) -> Modules l sem (Synthesized (Auto ConstantFold)) -> Modules l sem (Inherited (Auto ConstantFold)) #
Ord (QualIdent l) => Synthesizer (Auto ConstantFold) (Modules l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods synthesis :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Auto ConstantFold -> Placed (Modules l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Modules l sem sem) -> Modules l sem (Synthesized (Auto ConstantFold)) -> Atts (Synthesized (Auto ConstantFold)) (Modules l sem sem) #
(Nameable l, Ord (QualIdent l), Atts (Synthesized (Auto ConstantFold)) (Declaration l l Sem Sem) ~ SynCFMod' l (Declaration l l), Atts (Inherited (Auto ConstantFold)) (StatementSequence l l Sem Sem) ~ InhCF l, Atts (Inherited (Auto ConstantFold)) (Declaration l l Sem Sem) ~ InhCF l) => Bequether (Auto ConstantFold) (Block l l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods bequest :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Auto ConstantFold -> Placed (Block l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Block l l sem sem) -> Block l l sem (Synthesized (Auto ConstantFold)) -> Block l l sem (Inherited (Auto ConstantFold)) #
(Nameable l, Ord (QualIdent l), Atts (Synthesized (Auto ConstantFold)) (Declaration l l Sem Sem) ~ SynCFMod' l (Declaration l l), Atts (Inherited (Auto ConstantFold)) (StatementSequence l l Sem Sem) ~ InhCF l, Atts (Inherited (Auto ConstantFold)) (Declaration l l Sem Sem) ~ InhCF l) => Bequether (Auto ConstantFold) (Block l l) Sem Placed Source #
Instance details Defined in Language.Modula2.ISO.ConstantFolder Methods bequest :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Auto ConstantFold -> Placed (Block l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Block l l sem sem) -> Block l l sem (Synthesized (Auto ConstantFold)) -> Block l l sem (Inherited (Auto ConstantFold)) #
(Oberon l, Nameable l, Ord (QualIdent l), Show (QualIdent l), Atts (Synthesized (Auto ConstantFold)) (Block l l Sem Sem) ~ SynCFMod' l (Block l l)) => Synthesizer (Auto ConstantFold) (Module l l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods synthesis :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Auto ConstantFold -> Placed (Module l l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Module l l sem sem) -> Module l l sem (Synthesized (Auto ConstantFold)) -> Atts (Synthesized (Auto ConstantFold)) (Module l l sem sem) #
(Oberon l, Nameable l, Ord (QualIdent l), Value l ~ Value l, InhCF l ~ InhCF λ, Pretty (Value λ λ Identity Identity), Atts (Synthesized (Auto ConstantFold)) (Expression l l Sem Sem) ~ SynCFExp l l, Atts (Synthesized (Auto ConstantFold)) (Element l l Sem Sem) ~ SynCF' (Element l l), Atts (Synthesized (Auto ConstantFold)) (Designator l l Sem Sem) ~ SynCFDesignator l) => Synthesizer (Auto ConstantFold) (Expression λ l) Sem Placed
Instance details Defined in Language.Oberon.ConstantFolder Methods synthesis :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Auto ConstantFold -> Placed (Expression λ l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Expression λ l sem sem) -> Expression λ l sem (Synthesized (Auto ConstantFold)) -> Atts (Synthesized (Auto ConstantFold)) (Expression λ l sem sem) #
(Nameable l, Ord (QualIdent l), QualIdent l ~ QualIdent l, Value l ~ Value l, λ ~ Language, Coercible (QualIdent Language) (QualIdent l), Coercible (Value Language Language) (Value l l), InhCF l ~ InhCF λ, Pretty (Value l l Identity Identity), Atts (Synthesized (Auto ConstantFold)) (Expression l l Sem Sem) ~ SynCFExp l l, Atts (Synthesized (Auto ConstantFold)) (Element l l Sem Sem) ~ SynCF' (Element l l), Atts (Synthesized (Auto ConstantFold)) (Item l l Sem Sem) ~ SynCF' (Item l l), Atts (Synthesized (Auto ConstantFold)) (Designator l l Sem Sem) ~ SynCFDesignator l) => Synthesizer (Auto ConstantFold) (Expression λ l) Sem Placed Source #
Instance details Defined in Language.Modula2.ISO.ConstantFolder Methods synthesis :: forall (sem :: Type -> Type). sem ~ Semantics (Auto ConstantFold) => Auto ConstantFold -> Placed (Expression λ l Sem Sem) -> Atts (Inherited (Auto ConstantFold)) (Expression λ l sem sem) -> Expression λ l sem (Synthesized (Auto ConstantFold)) -> Atts (Synthesized (Auto ConstantFold)) (Expression λ l sem sem) #
LexicalParsing (Parser (ISOGrammar l) Text) Source #
Instance details Defined in Language.Modula2.ISO.Grammar Methods lexicalWhiteSpace :: Parser (ISOGrammar l) Text () # someLexicalSpace :: Parser (ISOGrammar l) Text () # lexicalComment :: Parser (ISOGrammar l) Text () # lexicalSemicolon :: Parser (ISOGrammar l) Text Char # lexicalToken :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # identifierToken :: Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) -> Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) # isIdentifierStartChar :: Char -> Bool # isIdentifierFollowChar :: Char -> Bool # identifier :: Parser (ISOGrammar l) Text (ParserInput (Parser (ISOGrammar l) Text)) # keyword :: ParserInput (Parser (ISOGrammar l) Text) -> Parser (ISOGrammar l) Text () #
TokenParsing (Parser (ISOGrammar l) Text) Source #
Instance details Defined in Language.Modula2.ISO.Grammar Methods someSpace :: Parser (ISOGrammar l) Text () # nesting :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # semi :: Parser (ISOGrammar l) Text Char # highlight :: Highlight -> Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a # token :: Parser (ISOGrammar l) Text a -> Parser (ISOGrammar l) Text a #