Skip to content
#

lexer-generator

Here are 62 public repositories matching this topic...

logos
CAD97
CAD97 commented Apr 21, 2020

This shouldn't be too difficult to add support for.

As an example, \\u\{(?:10|[0-9])[0-9a-fA-F]{0,4}\} would just expand to \\u\{(?:10|[0-9])[0-9a-fA-F]?[0-9a-fA-F]?[0-9a-fA-F]?[0-9a-fA-F]?.

That is, expand to n copies of the repeated node and m-n copies of the repeated node but optional.

The "regex optimized" version would be expanding to nested optionals, so `nnn(?:m(?:m(?:m)?)?

The regex-centric, fast lexical analyzer generator for C++ with full Unicode support. Faster than Flex and other regex matchers. Accepts Flex specifications. Generates reusable source code that is easy to understand. Easily integrates with Bison and other parsers. Includes a fast stand-alone regex engine and library.

  • Updated May 25, 2020
  • C++

Improve this page

Add a description, image, and links to the lexer-generator topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the lexer-generator topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.