All Versions
12
Latest Version
Avg Release Cycle
83 days
Latest Release
1321 days ago

Changelog History
Page 1

  • v0.2.7 Changes

    December 25, 2022
    • ๐Ÿ–จ revising printing production rules in the debug mode during parsing.
  • v0.2.6 Changes

    April 17, 2022
    • โž• adding a header for candidates
  • v0.2.5 Changes

    April 16, 2022
    • ๐Ÿ–จ print parsing time as well as candidates computation time
      ๐Ÿ“œ : ParserSpec has been changed to include two new fields on the parsing time
      ๐Ÿ“œ : src/util/ParserTime.hs will be useful for filling the fields in.
  • v0.2.4 Changes

    April 15, 2022
    • ๐Ÿ“œ Search syntax completion candidates with only the filtered symbols (ParserSpec has a new field for this purpose)
    • โœ… A new interface to write yapb.config useful for testing
    • โšก๏ธ update README
  • v0.2.3 Changes

    April 04, 2022

    Measure execution time

  • v0.2.2 Changes

    April 04, 2022

    ๐Ÿ›  Fix a bug on handling terminals mixed with alphabets and symbols such as zero?.

  • v0.2.1 Changes

    March 27, 2022
    • ๐Ÿ›  fix the bugs on as-patterns around spaces (to be accepted by ghc-9.x.x)
  • v0.2.0 Changes

    March 27, 2022

    What's new

    • ๐Ÿ“œ As a tutorial, the most up-to-date examples are available in app/{parser,ambiguous,error,syntaxcompletion}
    • ๐Ÿ‘€ Threaded lexers are supported, so a lexer and a parser can talk back and forth through a monad about parsing states. (See an example in app/parser)
    • ๐Ÿ‘€ Precedences can be specified in the parser specifications to disambiguate ambiguous grammars (See Sec 4.9.2 in the Dragon book 3rd Ed. and an example in app/ambiguous)
    • ๐Ÿ‘€ Error recovery is supported (See Sec.4.9.4 in the Dragon book 3rd Ed. and an example in app/error)
    • ๐Ÿ‘€ The syntax completion algorithms are configurable and become stable. (See app/syntaxcompletion)
    • ๐Ÿ‘€ Now the real-world parser examples for two programming languages Small Basic and C11 are available separately (see https://github.com/kwanghoon/{sbparser,c11parser}).
    • ๐Ÿ‘€ Another example for Haskell is available separately where the GHC lexer and the automaton generated from GHC Happy based parser are incorporated with our automaton engine to be a Haskell parser. (see https://github.com/kwanghoon/hslexer).
  • v0.1.3.2 Changes

    October 27, 2021
    • โœ… 'stack test' is supported
    • ๐Ÿ–จ suppress unnecessary internal prints
  • v0.1.3.1 Changes

    September 30, 2021