C++ grammar for the Lezer parser system
  • JavaScript 100%
Find a file
2026-04-14 17:24:26 +02:00
dist Conform to expectation of recent TS versions 2023-07-03 10:54:59 +02:00
src Support multiple identifiers in using declarations 2026-01-08 09:35:05 +01:00
test Support multiple identifiers in using declarations 2026-01-08 09:35:05 +01:00
.gitignore Add boilerplate files 2020-08-26 12:40:09 +02:00
.npmignore Add boilerplate files 2020-08-26 12:40:09 +02:00
CHANGELOG.md Mark version 1.1.5 2026-01-05 09:42:54 +01:00
LICENSE Update maintainer email 2023-01-24 08:28:49 +01:00
package.json Update github links 2026-04-14 17:24:26 +02:00
README.md Adjust readme to scoped package name 2021-09-01 11:08:58 +02:00
rollup.config.js Conform to expectation of recent TS versions 2023-07-03 10:54:59 +02:00

@lezer/cpp

This is a C++ grammar for the Lezer parser system.

The grammar used is based in a large part on the corresponding tree-sitter grammar.

It should be noted that really parsing C++ without a symbol table and a preprocessor is not really something that is possible. The language is very, very ambiguous when parsed like that. This grammar tries to pick a likely parse, but is entirely capable of picking the wrong one.

The code is licensed under an MIT license.