Skip to content

Latest commit

 

History

History
137 lines (113 loc) · 3.83 KB

CHANGES.md

File metadata and controls

137 lines (113 loc) · 3.83 KB
Raw

Development history

0.7.0

2014-05-27

  • In-browser demo of JSON parser. Compiled with ScalaJS.
  • Improvements:
    • Flat mode of syntax error recovery based on skips entire fragments. Turned on by default.
    • Ctags support.
    • Fragment.getTokens becomes a public method.
    • Rule Tree reflection features. Traversing structure of rules belong to Node.
    • Node.visit becomes a public method.
  • Bug fix:
    • Ignoring removed tokens of detached Nodes.
    • Wrong difference of files with trailing empty lines.
    • Lexer.input works wrong when the cursor bounds provided explicitly.
    • Top level fragments wrong parsing. Appropriate "comments" parsing test added.

0.6.1

2014-02-20

  • Bug in packrat cache fixed.

0.6.0

2014-02-16

  • Syntax rule construction API major rework.
  • New features:
    • Node.getValues method to retrieve captured parts separately.
    • Tracking child branches using Node.onAddBranch event.
    • AST Node random access by ID.
    • Direct access to the top node of the AST.
  • Bug fix:
    • Children node track in wrong order.
    • Minor issue in pretty print procedure.
    • Caching minor issues.

0.5.0

2013-12-10

  • New features:
    • Debug Monitor that shows parse steps of the selected parse rule.
    • Node smart merging. Now merging procedure reuses branches of the previously parsed node.
  • Minor improvements:
    • Nodes support hash function.
    • Rule pretty printing.
  • Bug fix:
    • Zombie-monitors removing.
    • Major issue in Packrat cache fixed.

0.4.2

2013-12-04

  • Bug fix:
    • Fragment forceful skipping/using, i.e comments erasing case.
    • Repetition rule bug.
    • Referential rule for without tag.
    • Choice Rule bug in selection of the suitable recoverable candidate.
  • Minor improvements:
    • Node construction in call-chain way.
    • Optional token consumption feature in Expression parser.
    • Line offset token tracking.
    • Syntax parser in ParserSpec can be instantiated separately from the lexer.
    • Empty Monitor that tracks nothing. For simple debug purposes.

0.4.1

2013-11-30

  • Node's additional constructor.
  • Node's new property: "constant". When set forcefully overrides appropriate referenced token value.
  • Recover Rule constructor renamed to "permissive".
  • Require Rule introduced.

0.4.0

2013-11-21

  • AST improvements:
    • Node's reference to it's parent.
    • Update event propagation up to root.
    • Node numeration order bug fixed.
  • Error recovery minor improvements.
  • SBT configuration major improvement.
  • Artifacts can be published to Sonatype.

0.3.0

2013-10-15

  • Expression parsing rule based on Pratt's algorithm implemented.
  • Several parslet constructors for Expression parser implemented.
  • Calculator parser example implemented. As well as appropriate functional tests.
  • Minor improvements:
    • Avoid rule construction for simple rule nesting cases.
    • Some identifiers were renamed.

0.2.0

2013-10-07

  • Lexer and Syntax parser grammar definition API changed from operator based to function based.
  • Three additional functional tests for Json example parser implemented. These three test were designed specifically to test various code fragmentation cases.
  • Minor refactoring:
    • Term "environment" renamed to "monitor" in context of functional tests.
    • Directory structure simplified.

0.1.0

2013-10-05

The project source code was derived from the internal project "Malvina" developed and copyrighted by Ilya Lakhin (Илья Александрович Лахин). The code is published under the terms of Apache Public License v2: http://www.apache.org/licenses/LICENSE-2.0.txt

Last commit in the private repository where the "Papa Carlo" was derived from is: Eliah-Lakhin/malvina-prototype-b@d1d863f227e79ee27c4d69fdce1eb8c5146dacd4