Data.Array.Repa.Index.Points

Index structures for left- and right-linear grammars. Do not use this index for general linear- or context-free grammars.

Internally, both PointL and PointR work a lot like Subwords, but in non-terminals we only store the left- or right part.

Documentation

newtype PointL

A point in left-linear grammars. In (i:.j), j is the non-terminal storage point, i==0 always for the non-terminal, while i>=0 for terminals, which are on the right of the non-terminal. (This is why left-linear grammars are called left-linear: they recurse on the left).

PS: all this left/right talk deals with the RHS of a production rule, the LHS is always a non-terminal ;-)

Constructors

PointL (Int :. Int)

Instances

Eq PointL

Read PointL

Show PointL

Arbitrary PointL

NFData PointL

Unbox PointL

Vector Vector PointL

MVector MVector PointL

Arbitrary z => Arbitrary (:. z PointL)

Shape sh => Shape (:. sh PointL)

ExtShape sh => ExtShape (:. sh PointL)

pointL :: Int -> Int -> PointL

newtype PointR

A point in right-linear grammars.

Constructors

PointR (Int :. Int)

Instances

Unbox PointR

Vector Vector PointR

MVector MVector PointR

pointR :: Int -> Int -> PointR

Instances