@@ -4,8 +4,8 @@ synopsis: Reversible parsing and pretty-printing.
4description:
4description:
5 "syntax" allows you to write a single syntax description and instantiate is both as a parser and a pretty printer.
5 "syntax" allows you to write a single syntax description and instantiate is both as a parser and a pretty printer.
7− Syntax descriptions are written in applicative or arrow style. The library uses a custom hierarchy, provided by the
7+ Syntax descriptions are written in applicative or arrow style. The library uses a custom typeclass hierarchy, provided
8− "semi-iso" package. Most of the time you will be using operators like '/$/' and '/*/', just like parser combinators.
8+ by the "semi-iso" package. Most of the time you will be using operators like '/$/' and '/*/', just like parser combinators.
9 When more power is needed - e.g. when the syntax depends on the parsed or printed value - you turn to arrows.
9 When more power is needed - e.g. when the syntax depends on the parsed or printed value - you turn to arrows.
11 Semi-isomorphisms from "semi-iso" are the basic building block of syntax descriptions. I recommend reading
11 Semi-isomorphisms from "semi-iso" are the basic building block of syntax descriptions. I recommend reading
@@ -19,7 +19,7 @@ description:
19 Advanced formatting and parsing (for example indentation, haskell layout rule) is implemented as category transformers
19 Advanced formatting and parsing (for example indentation, haskell layout rule) is implemented as category transformers
20 (similar to monad transformers). Currently only simple indentation is implemented (in "Data.Syntax.Indent") - basically
20 (similar to monad transformers). Currently only simple indentation is implemented (in "Data.Syntax.Indent") - basically
21 a reader category transformer that tracks current indentation level. I plan on implementing Haskell layout rule in the
21 a reader category transformer that tracks current indentation level. I plan on implementing Haskell layout rule in the
22− future (as a reusable transformer).
22+ future.
24 Note that the library can work with both text and binary data. There are no binary combinators implemented - yet.
24 Note that the library can work with both text and binary data. There are no binary combinators implemented - yet.
25 Alas, these are not only useful combinators missing! I will slowly but steadily implement them over time
25 Alas, these are not only useful combinators missing! I will slowly but steadily implement them over time