# Earley: Parsing all context-free grammars using Earley's algorithm.

[ bsd3, library, parsing ] [ Propose Tags ]

Versions [faq] 0.6.0, 0.7.0, 0.7.1, 0.8.0, 0.8.1, 0.8.2, 0.8.3, 0.9.0, 0.10.0, 0.10.0.1, 0.10.1.0, 0.11.0.0, 0.11.0.1, 0.12.0.0, 0.12.0.1, 0.12.1.0, 0.13.0.0, 0.13.0.1 CHANGELOG.md base (>=4.6 && <4.10), Earley, ListLike (>=4.1), unordered-containers (>=0.2) [details] BSD-3-Clause (c) 2014-2015 Olle Fredriksson Olle Fredriksson fredriksson.olle@gmail.com Parsing head: git clone https://github.com/ollef/Earley.git by OlleFredriksson at Fri Mar 18 07:45:38 UTC 2016 LTSHaskell:0.13.0.1, NixOS:0.13.0.1, Stackage:0.13.0.1 earley-infinite, earley-words, earley-very-ambiguous, earley-mixfix, earley-expr2, earley-expr, earley-english 10945 total (333 in the last 30 days) (no votes yet) [estimated by rule of succession] λ λ λ Docs uploaded by userBuild status unknown

[Index]

## Flags

NameDescriptionDefaultType
examples

"Build examples"

DisabledManual

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

#### Maintainer's Corner

For package maintainers and hackage trustees

[back to package description]

# Earley

Go to the API documentation on Hackage.

This (Text.Earley) is a library consisting of two main parts:

1. Text.Earley.Grammar: An embedded context-free grammar (CFG) domain-specific language (DSL) with semantic action specification in applicative style.

An example of a typical expression grammar working on an input tokenised into strings is the following:

   expr :: Grammar r (Prod r String String Expr)
expr = mdo
x1 <- rule $Add <$> x1 <* namedSymbol "+" <*> x2
<|> x2
<?> "sum"
x2 <- rule $Mul <$> x2 <* namedSymbol "*" <*> x3
<|> x3
<?> "product"
x3 <- rule $Var <$> (satisfy ident <?> "identifier")
<|> namedSymbol "(" *> x1 <* namedSymbol ")"
return x1
where
ident (x:_) = isAlpha x
ident _     = False

2. Text.Earley.Parser: An implementation of (a modification of) the Earley parsing algorithm.

To invoke the parser on the above grammar, run e.g. (here using words as a stupid tokeniser):

   fullParses (parser expr) $words "a + b * ( c + d )" = ( [Add (Var "a") (Mul (Var "b") (Add (Var "c") (Var "d")))] , Report {...} )  Note that we get a list of all the possible parses (though in this case there is only one). Another invocation, which shows the error reporting capabilities (giving the last position that the parser reached and what it expected at that point), is the following:  fullParses (parser expr)$ words "a +"
= ( []
, Report { position   = 2
, expected   = ["(","identifier","product"]
, unconsumed = []
}
)


Text.Earley.Mixfix additionally includes helper functionality for creating parsers for expressions with mixfix identifiers in the style of Agda.

## How do I write grammars?

As hinted at above, the grammars are written inside Grammar, which is a Monad and MonadFix. For the library to be able to tame the recursion in the grammars, we have to use the rule function whenever a production is recursive.

Whenever you would write e.g.

...
p = foo <|> bar <*> p
...


in a conventional combinator parser library, you instead write the following:

grammar = mdo
...
p <- rule \$ foo <|> bar <*> p
...


Apart from making it possible to do recursion (even left-recursion), rules have an additional benefit: they control where work is shared, by the rule that any rule is only ever expanded once per position in the input string. If a rule is encountered more than once at a position, the work is shared.

## Compared to parser generators and combinator libraries

This library differs from the main methods that are used to write parsers in the Haskell ecosystem:

• Compared to parser generators (YACC, Happy, etc.) it requires very little pre-processing of the grammar. It also allows you to stay in the host language for both grammar and parser, i.e. there is no use of a separate tool. This also means that you are free to use the abstraction facilities of Haskell when writing a grammar. Currently the library requires a linear traversal of the grammar's rules before use, which is usually fast enough to do at run time, but precludes infinite grammars.

• The grammar language is similar to that of many parser combinators (Parsec, Attoparsec, parallel parsing processes, etc.), providing an applicative interface, but the parser gracefully handles all finite CFGs, including those with left-recursion. On the other hand, its productions are not monadic meaning that it does not support context-sensitive or infinite grammars, which are supported by many parser combinator libraries.

Note: The Grammar type is a Monad (used to provide observable sharing) but it lives a layer above productions. It cannot be used to decide what production to use depending on the result of a previous production, i.e. it does not give us monadic parsing.

## The parsing algorithm

The parsing algorithm that this library uses is based on Earley's parsing algorithm. The algorithm has been modified to produce online parse results, to give good error messages, and to allow garbage collection of the item sets. Essentially, instead of storing a sequence of sets of items like in the original algorithm, the modified algorithm just stores pointers back to sets of reachable items.

The worst-case run time performance of the Earley parsing algorithm is cubic in the length of the input, but for large classes of grammars it is linear. It should however be noted that this library will likely be slower than most parser generators and parser combinator libraries.

The parser implements an optimisation similar to that presented in Joop M.I.M Leo's paper A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead, which removes indirections in sequences of non-ambiguous backpointers between item sets.

For more in-depth information about the internals of the library, there are implementation notes currently being written.

## Contact

Olle Fredriksson - https://github.com/ollef