chilon changelog

• release 1.5
  • Spacing? is now parsed between elements in a sequence rather than Spacing*
• release 1.4
  • variant avoids using heap for pointer elements.
  • many*<void storing parser> works.
  • Added tbpeg_not which acts like not_ but skips char storing subparsers
• release 1.3.1
  • fixed missing include from release 1.3
  • variant< vector<T>, void > now stores vector<T>. The vector being empty signifies nothing was parsed.
• release 1.3
  • tree_joined_lexeme
  • choice<> containing keys can be hashed into variant_vector_hash_map multi-index container
  • joined* over key<> subexpressions stores a hash.
  • make sequences with tree_optional always prefer to use tree_optional subexpression if possible.
  • fix optional storing variant within variant.
  • fixed bug with choices nested within sequences.
  • updated documentation.
• release 1.2
  • chilon::vector_hash_map used by default for hashes now. this stores AST items in the order in which they were parsed but also contains a find() method for looking up elements based on a fast hash of the key data.
  • variants are comparable and can be hashed, so can be used as keys
  • vector types can be used as keys
  • key_plus for additivie keys
  • simplify code for hashing
  • remove need for hash<>
  • fix memory leak in variant assignment operator from same typed variant
  • optimise variant assignment
  • append library
  • vector_hash_map supports key_merged
• release 1.1
  • code simplifications
  • allowed more parser templates to take multiple arguments in which
  • case a child sequence is created.
  • many<> optimised and can now hash items rather than storing them in
  • a vector using the hash<> and key<> templates.
  • limit is now first argument to until.
• release 1.0
  • finish tree_optional
  • update documentation
• release 0.9.1
  • make choice more intelligent by looking for common prefixes to
  • parsers and factoring them out in the search
• release 0.9
  • left hand side tree restriction + tutorial 8
• release 0.8.3
  • allow non-storing types to be used with choice outside of lexeme.
  • tree<> parser for making a bottom-up tree parser with recursive matching
  • add tutorial 7 to show use of tree.
• release 0.8.2
  • test<T> (&T)
  • not<T> (! T)
  • optional<T> (T?)

previous