Language.Oberon.Grammar

Oberon grammar adapted from http://www.ethoberon.ethz.ch/EBNF.html

Extracted from the book Programmieren in Oberon - Das neue Pascal by N. Wirth and M. Reiser and translated by J. Templ.

The grammars in this module attempt to follow the language grammars from the reports, while generating a semantically meaningful abstract syntax tree; the latter is defined in Language.Oberon.AST. As the grammars are ambiguous, it is necessary to resolve the ambiguities after parsing all Oberon modules in use. Language.Oberon.Resolver provides this functionality. Only after the ambiguity resolution can the abstract syntax tree be pretty-printed using the instances from Language.Oberon.Pretty. Alternatively, since the parsing preserves the original parsed lexemes including comments in the AST, you can use Language.Oberon.Reserializer to reproduce the original source code from the AST.

Documentation

data OberonGrammar l f p

All the productions of the Oberon grammar

Constructors

OberonGrammar

Fields

• module_prod :: p (f (Module l l f f))
• ident :: p Ident
• letter :: p Text
• digit :: p Text
• importList :: p [Import l]
• import_prod :: p (Import l)
• declarationSequence :: p [f (Declaration l l f f)]
• constantDeclaration :: p (Declaration l l f f)
• identdef :: p (IdentDef l)
• constExpression :: p (f (Expression l l f f))
• expression :: p (f (Expression l l f f))
• simpleExpression :: p (f (Expression l l f f))
• term :: p (f (Expression l l f f))
• factor :: p (f (Expression l l f f))
• number :: p (Value l l f f)
• integer :: p (Value l l f f)
• hexDigit :: p Text
• real :: p (Value l l f f)
• scaleFactor :: p Text
• charConstant :: p (Value l l f f)
• string_prod :: p Text
• set :: p (Expression l l f f)
• element :: p (Element l l f f)
• designator :: p (f (Designator l l f f))
• unguardedDesignator :: p (Designator l l f f)
• expList :: p (NonEmpty (f (Expression l l f f)))
• actualParameters :: p [f (Expression l l f f)]
• mulOperator :: p (BinOp l f)
• addOperator :: p (BinOp l f)
• relation :: p RelOp
• typeDeclaration :: p (Declaration l l f f)
• type_prod :: p (Type l l f f)
• qualident :: p (QualIdent l)
• arrayType :: p (Type l l f f)
• length :: p (f (Expression l l f f))
• recordType :: p (Type l l f f)
• baseType :: p (BaseType l)
• fieldListSequence :: p [f (FieldList l l f f)]
• fieldList :: p (FieldList l l f f)
• identList :: p (IdentList l)
• pointerType :: p (Type l l f f)
• procedureType :: p (Type l l f f)
• variableDeclaration :: p (Declaration l l f f)
• procedureDeclaration :: p (Declaration l l f f)
• procedureHeading :: p (Ident, ProcedureHeading 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)
• procedureBody :: p (Block l l f f)
• forwardDeclaration :: p (Declaration l l f f)
• statementSequence :: p (StatementSequence l l f f)
• statement :: p (f (Statement l l f f))
• assignment :: p (Statement l l f f)
• procedureCall :: p (Statement 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)
• caseLabelList :: p (NonEmpty (f (CaseLabels l l f f)))
• caseLabels :: p (CaseLabels 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)

Instances

Applicative (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

pure :: (forall (a :: k). f0 a) -> OberonGrammar l f f0

Apply (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

(<*>) :: forall (p :: k -> Type) (q :: k -> Type). OberonGrammar l f (p ~> q) -> OberonGrammar l f p -> OberonGrammar l f q

liftA2 :: (forall (a :: k). p a -> q a -> r a) -> OberonGrammar l f p -> OberonGrammar l f q -> OberonGrammar l f r

liftA3 :: (forall (a :: k). p a -> q a -> r a -> s a) -> OberonGrammar l f p -> OberonGrammar l f q -> OberonGrammar l f r -> OberonGrammar l f s

Distributive (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

collect :: forall p a (q :: k1 -> Type). Functor p => (a -> OberonGrammar l f q) -> p a -> OberonGrammar l f (Compose p q)

distribute :: forall p (q :: k1 -> Type). Functor p => p (OberonGrammar l f q) -> OberonGrammar l f (Compose p q)

cotraverse :: Functor m => (forall (a :: k1). m (p a) -> q a) -> m (OberonGrammar l f p) -> OberonGrammar l f q

DistributiveTraversable (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

collectTraversable :: forall f1 a (f2 :: k -> Type). Traversable f1 => (a -> OberonGrammar l f f2) -> f1 a -> OberonGrammar l f (Compose f1 f2)

distributeTraversable :: forall f1 (f2 :: k -> Type). Traversable f1 => f1 (OberonGrammar l f f2) -> OberonGrammar l f (Compose f1 f2)

cotraverseTraversable :: Traversable f1 => (forall (x :: k). f1 (f2 x) -> f0 x) -> f1 (OberonGrammar l f f2) -> OberonGrammar l f f0

Foldable (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

foldMap :: Monoid m => (forall (a :: k). p a -> m) -> OberonGrammar l f p -> m

Functor (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

(<$>) :: (forall (a :: k). p a -> q a) -> OberonGrammar l f p -> OberonGrammar l f q

Logistic (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

deliver :: forall p (q :: k1 -> Type). Contravariant p => p (OberonGrammar l f q -> OberonGrammar l f q) -> OberonGrammar l f (Compose p (q ~> q))

Traversable (OberonGrammar l f :: (Type -> Type) -> Type)

Defined in Language.Oberon.Grammar

Methods

traverse :: Applicative m => (forall (a :: k). p a -> m (q a)) -> OberonGrammar l f p -> m (OberonGrammar l f q)

sequence :: forall m (p :: k -> Type). Applicative m => OberonGrammar l f (Compose m p) -> m (OberonGrammar l f p)

LexicalParsing (Parser (OberonGrammar l f) Text)

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 ()

TokenParsing (Parser (OberonGrammar l f) Text)

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

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

type NodeWrap = Compose ((,) (Down Int, Down Int)) (Compose Ambiguous ((,) ParsedLexemes))

Every node in the parsed AST will be wrapped in this data type.

newtype ParsedLexemes

Constructors

Trailing [Lexeme]

Instances

Data ParsedLexemes

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

Monoid ParsedLexemes

Defined in Language.Oberon.Grammar

Methods

mempty :: ParsedLexemes

mappend :: ParsedLexemes -> ParsedLexemes -> ParsedLexemes

mconcat :: [ParsedLexemes] -> ParsedLexemes

Semigroup ParsedLexemes

Defined in Language.Oberon.Grammar

Methods

(<>) :: ParsedLexemes -> ParsedLexemes -> ParsedLexemes

sconcat :: NonEmpty ParsedLexemes -> ParsedLexemes

stimes :: Integral b => b -> ParsedLexemes -> ParsedLexemes

Show ParsedLexemes

Defined in Language.Oberon.Grammar

Methods

showsPrec :: Int -> ParsedLexemes -> ShowS

show :: ParsedLexemes -> String

showList :: [ParsedLexemes] -> ShowS

Eq ParsedLexemes

Defined in Language.Oberon.Grammar

Methods

(==) :: ParsedLexemes -> ParsedLexemes -> Bool

(/=) :: ParsedLexemes -> ParsedLexemes -> Bool

(Ord (QualIdent l), v ~ Value l l Placed Placed) => SynthesizedField "designatorValue" (Maybe (Placed v)) (Auto ConstantFold) (Designator l l) Sem Placed

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)

(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

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

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)

Ord (QualIdent l) => Bequether (Auto ConstantFold) (Modules l) Sem Placed

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

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

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))

(Oberon λ, Nameable l, Ord (QualIdent l), Value l ~ Value l, 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)) (Designator l l Sem Sem) ~ SynCFDesignator l) => Synthesizer (Auto ConstantFold) (Expression λ l) Sem Placed

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)

(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

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)

data Lexeme

Constructors

WhiteSpace

Fields

• lexemeText :: Text

Comment

Fields

• lexemeText :: Text

Token

Fields

• lexemeType :: TokenType
• lexemeText :: Text

Instances

Data Lexeme

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

Defined in Language.Oberon.Grammar

Methods

showsPrec :: Int -> Lexeme -> ShowS

show :: Lexeme -> String

showList :: [Lexeme] -> ShowS

Eq Lexeme

Defined in Language.Oberon.Grammar

Methods

(==) :: Lexeme -> Lexeme -> Bool

(/=) :: Lexeme -> Lexeme -> Bool

LexicalParsing (Parser (OberonGrammar l f) Text)

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 ()

TokenParsing (Parser (OberonGrammar l f) Text)

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

data TokenType

Constructors

Delimiter

Keyword

Operator

Other

Instances

Data TokenType

Defined in Language.Oberon.Grammar

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TokenType -> c TokenType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TokenType

toConstr :: TokenType -> Constr

dataTypeOf :: TokenType -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TokenType)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TokenType)

gmapT :: (forall b. Data b => b -> b) -> TokenType -> TokenType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TokenType -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TokenType -> r

gmapQ :: (forall d. Data d => d -> u) -> TokenType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TokenType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TokenType -> m TokenType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TokenType -> m TokenType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TokenType -> m TokenType

Show TokenType

Defined in Language.Oberon.Grammar

Methods

showsPrec :: Int -> TokenType -> ShowS

show :: TokenType -> String

showList :: [TokenType] -> ShowS

Eq TokenType

Defined in Language.Oberon.Grammar

Methods

(==) :: TokenType -> TokenType -> Bool

(/=) :: TokenType -> TokenType -> Bool

oberonGrammar :: Grammar (OberonGrammar Language NodeWrap) Parser Text

Grammar of an Oberon module

oberon2Grammar :: Grammar (OberonGrammar Language NodeWrap) Parser Text

Grammar of an Oberon-2 module

oberonDefinitionGrammar :: Grammar (OberonGrammar Language NodeWrap) Parser Text

Grammar of an Oberon definition module

oberon2DefinitionGrammar :: Grammar (OberonGrammar Language NodeWrap) Parser Text

Grammar of an Oberon-2 definition module