- data UPDomain phi ix where
- data UPBaseIx ix
- data UPHeadIx ix
- data UPTailIx ix
- data family UPValue r ix
- unUPBV :: UPValue r (UPBaseIx ix) -> r ix
- unUPHV :: UPValue r (UPHeadIx ix) -> r ix
- unUPTV :: UPValue r (UPTailIx ix) -> r ix -> r ix
- transformUniformPaull :: forall phi t r. Domain phi => ProcessingContextFreeGrammar phi t r -> ProcessingExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)
- transformUniformPaullP :: forall phi t r. Domain phi => ProcessingPenaltyContextFreeGrammar phi t r -> ProcessingPenaltyExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)
- transformUniformPaullE :: forall phi t r. Domain phi => ProcessingExtendedContextFreeGrammar phi t r -> ProcessingExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)
- transformUniformPaullLE :: forall phi t r. Domain phi => ProcessingLExtendedContextFreeGrammar phi t r -> ProcessingLExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)
Documentation
data UPDomain phi ix whereSource
UPBase :: phi ix -> UPDomain phi (UPBaseIx ix) | |
UPHead :: phi ix -> UPDomain phi (UPHeadIx ix) | |
UPTail :: phi ix -> UPDomain phi (UPTailIx ix) |
transformUniformPaull :: forall phi t r. Domain phi => ProcessingContextFreeGrammar phi t r -> ProcessingExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)Source
Apply a uniform variant of the classic Paull transformation to a given grammar, removing direct and indirect left recursion.
transformUniformPaullP :: forall phi t r. Domain phi => ProcessingPenaltyContextFreeGrammar phi t r -> ProcessingPenaltyExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)Source
transformUniformPaullE :: forall phi t r. Domain phi => ProcessingExtendedContextFreeGrammar phi t r -> ProcessingExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)Source
Apply a uniform variant of the classic Paull transformation to a given extended grammar, removing direct and indirect left recursion.
transformUniformPaullLE :: forall phi t r. Domain phi => ProcessingLExtendedContextFreeGrammar phi t r -> ProcessingLExtendedContextFreeGrammar (UPDomain phi) t (UPValue r)Source
Apply a uniform variant of the classic Paull transformation to a given extended liftable grammar, removing direct and indirect left recursion.