<commit_before>homepage: ''
changelog-type: markdown
hash: e38d1fab26014230fc80db97958e2ee6b02b71d33360ea014cd5c3830a8209fe
test-bench-deps:
  little-earley: -any
  base: -any
  containers: -any
  mtl: -any
  tasty-hunit: -any
  tasty: -any
maintainer: <EMAIL>
synopsis: Simple implementation of Earley parsing
changelog: |
  # Changelog of little-earley

  Latest version: https://gitlab.com/lysxia/little-earley/-/blob/main/CHANGELOG.md

  ## 0.1.0.0

  * First version. Released on an unsuspecting world.
basic-deps:
  base: ^>=4.14.1.0
  containers: -any
  mtl: -any
all-versions:
- 0.1.0.0
author: <NAME>
latest: 0.1.0.0
description-type: markdown
description: |
  # A little Earley parser

  Parser for context-free grammars.

  ## Example

  The following module defines a grammar for arithmetic expressions
  (like `1+2*3`). It defines:

  - A type of non-terminal symbols `Ns`.
  - A type of terminal symbols `Ts`.
  - The production rules of the grammar `arithRules`.
  - A matching function, which interprets terminal symbols `Ts` as sets of<commit_msg>Update from Hackage at 2021-05-29T17:50:46Z<commit_after>homepage: ''
changelog-type: markdown
hash: 26e64de4c042902ba1f3a7eb827e7926904cc6e5ea18786649fc2c723b4c39cc
test-bench-deps:
  little-earley: -any
  base: -any
  containers: -any
  mtl: -any
  tasty-hunit: -any
  tasty: -any
maintainer: <EMAIL>
synopsis: Simple implementation of Earley parsing
changelog: |
  # Changelog of little-earley

  Latest version: https://gitlab.com/lysxia/little-earley/-/blob/main/CHANGELOG.md

  ## 0.2.0.0

  - Simplify signature of `ambiguities`; refactor accounting of locations in parse trees.
  - Add informative error messages in `Result`

  ## 0.1.0.0

  - First version. Released on an unsuspecting world.
basic-deps:
  base: ^>=4.14.1.0
  containers: -any
  mtl: -any
all-versions:
- 0.1.0.0
- 0.2.0.0
author: <NAME>
latest: 0.2.0.0
description-type: markdown
description: |
  # A little Earley parser

  Parser for context-free grammars.

  ## Example

  The following module defines a grammar for arithmetic expressions
  (like `1+2*3`). It defines:

  - A type of non-terminal symbols `Ns`.
  - A type of terminal symbols `Ts`.
  - The production rules of the grammar `arithRules`.
  - A matching function, which interprets terminal symbols `Ts` as sets of
{'fraction_non_alphanumeric': 0.10905172413793103, 'fraction_numerical': 0.06206896551724138, 'mean_word_length': 3.6143141153081513, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 9, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 10, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '752743', 'n_tokens_mistral': 944, 'n_tokens_neox': 841, 'n_words': 240}