trcombine 0.11.0
See the version list below for details.
dotnet tool install --global trcombine --version 0.11.0
dotnet new tool-manifest # if you are setting up this repo dotnet tool install --local trcombine --version 0.11.0
#tool dotnet:?package=trcombine&version=0.11.0
nuke :add-package trcombine --version 0.11.0
Reads an Antlr4 grammar from stdin and identifies problems in the grammar.
This program is part of the Trash toolkit.
Product | Versions Compatible and additional computed target framework versions. |
---|---|
.NET | net5.0 is compatible. net5.0-windows was computed. net6.0 was computed. net6.0-android was computed. net6.0-ios was computed. net6.0-maccatalyst was computed. net6.0-macos was computed. net6.0-tvos was computed. net6.0-windows was computed. net7.0 was computed. net7.0-android was computed. net7.0-ios was computed. net7.0-maccatalyst was computed. net7.0-macos was computed. net7.0-tvos was computed. net7.0-windows was computed. net8.0 was computed. net8.0-android was computed. net8.0-browser was computed. net8.0-ios was computed. net8.0-maccatalyst was computed. net8.0-macos was computed. net8.0-tvos was computed. net8.0-windows was computed. |
This package has no dependencies.
Version | Downloads | Last updated |
---|---|---|
0.23.8 | 117 | 11/1/2024 |
0.23.7 | 2,557 | 10/9/2024 |
0.23.6 | 728 | 9/21/2024 |
0.23.5 | 104 | 9/15/2024 |
0.23.4 | 103 | 9/7/2024 |
0.23.3 | 117 | 8/15/2024 |
0.23.2 | 123 | 6/28/2024 |
0.23.1 | 110 | 6/22/2024 |
0.23.0 | 186 | 4/25/2024 |
0.22.0 | 179 | 2/26/2024 |
0.21.16 | 272 | 11/16/2023 |
0.21.15 | 175 | 11/16/2023 |
0.21.14 | 182 | 11/15/2023 |
0.21.13 | 188 | 11/14/2023 |
0.21.12 | 279 | 10/27/2023 |
0.21.11 | 276 | 10/24/2023 |
0.21.9 | 286 | 9/27/2023 |
0.21.8 | 301 | 9/26/2023 |
0.21.7 | 232 | 9/26/2023 |
0.21.6 | 221 | 9/20/2023 |
0.21.5 | 204 | 9/18/2023 |
0.21.4 | 167 | 9/17/2023 |
0.21.3 | 201 | 9/14/2023 |
0.21.2 | 239 | 9/4/2023 |
0.21.1 | 316 | 8/15/2023 |
0.21.0 | 249 | 6/25/2023 |
0.20.27 | 224 | 6/15/2023 |
0.20.26 | 227 | 6/5/2023 |
0.20.25 | 213 | 6/3/2023 |
0.20.24 | 218 | 6/1/2023 |
0.20.23 | 172 | 5/31/2023 |
0.20.22 | 218 | 5/21/2023 |
0.20.21 | 228 | 5/15/2023 |
0.20.20 | 193 | 5/11/2023 |
0.20.19 | 195 | 5/8/2023 |
0.20.18 | 175 | 5/8/2023 |
0.20.17 | 212 | 5/4/2023 |
0.20.16 | 224 | 5/1/2023 |
0.20.15 | 209 | 4/27/2023 |
0.20.14 | 248 | 4/21/2023 |
0.20.13 | 271 | 4/13/2023 |
0.20.12 | 330 | 3/17/2023 |
0.20.11 | 294 | 3/15/2023 |
0.20.10 | 299 | 3/15/2023 |
0.20.9 | 299 | 3/14/2023 |
0.20.8 | 280 | 3/14/2023 |
0.20.7 | 273 | 3/13/2023 |
0.20.6 | 302 | 3/11/2023 |
0.20.5 | 327 | 3/11/2023 |
0.20.4 | 274 | 3/9/2023 |
0.20.3 | 281 | 3/8/2023 |
0.20.2 | 317 | 3/7/2023 |
0.20.1 | 291 | 3/7/2023 |
0.18.1 | 577 | 11/11/2022 |
0.18.0 | 460 | 11/7/2022 |
0.17.0 | 544 | 9/11/2022 |
0.16.5 | 547 | 7/29/2022 |
0.16.4 | 548 | 6/13/2022 |
0.16.3 | 637 | 5/7/2022 |
0.16.2 | 583 | 5/6/2022 |
0.16.1 | 573 | 5/5/2022 |
0.16.0 | 613 | 4/13/2022 |
0.15.1 | 599 | 4/4/2022 |
0.15.0 | 575 | 3/20/2022 |
0.14.3 | 592 | 2/27/2022 |
0.14.2 | 584 | 2/18/2022 |
0.14.1 | 616 | 1/26/2022 |
0.14.0 | 568 | 1/26/2022 |
0.13.8 | 588 | 1/14/2022 |
0.13.7 | 613 | 1/13/2022 |
0.13.6 | 576 | 1/13/2022 |
0.13.5 | 605 | 1/12/2022 |
0.13.4 | 592 | 1/11/2022 |
0.13.3 | 582 | 1/10/2022 |
0.13.2 | 400 | 12/24/2021 |
0.13.1 | 421 | 12/24/2021 |
0.13.0 | 428 | 12/23/2021 |
0.12.0 | 449 | 12/6/2021 |
0.11.5 | 514 | 10/17/2021 |
0.11.4 | 483 | 10/17/2021 |
0.11.3 | 473 | 9/28/2021 |
0.11.2 | 447 | 9/26/2021 |
0.11.1 | 462 | 9/25/2021 |
0.11.0 | 502 | 9/24/2021 |
0.10.0 | 532 | 9/9/2021 |
0.8.9 | 440 | 8/13/2021 |
0.8.8 | 434 | 8/5/2021 |
0.8.7 | 437 | 7/20/2021 |
0.8.6 | 469 | 7/13/2021 |
0.8.5 | 439 | 7/6/2021 |
0.8.4 | 422 | 6/24/2021 |
0.8.3 | 519 | 6/13/2021 |
0.8.2 | 444 | 6/8/2021 |
0.8.1 | 460 | 6/2/2021 |
# trcombine
Combine two grammars into one.
One grammar must be a lexer grammar, the other a parser grammar,
order is irrelevant. The output is parse tree data.
# Usage
trcombine <grammar1> <grammar2>
# Details
`trcombine` combines grammars that are known as "split grammars"
(separate Antlr4 lexer and parser grammars)
into one grammar, known as a "combined grammar". This refactoring is
useful if a simplified grammar grammar is wanted, and if possible if
the split grammar does not use the "superClass" option in one or the other
grammars. The opposite refactoring is implemented by
[trsplit](https://github.com/kaby76/Domemtech.Trash/tree/main/trsplit).
The split refactoring performs several operations:
* Combine the two files together, parser grammar first, then lexer grammar.
* Remove the `grammarDecl` for the lexer rules, and change the `grammarDecl`
for the parser rules to be a combined grammar declaration. Rename the name
of the parser grammar to not have "Parser" at the tail of the name.
* Remove the `optionsSpec` for the lexer section.
* Remove any occurrence of "tokenVocab" from the `optionsSpec` of the parser section.
* If the `optionsSpec` is empty, it is removed.
The order of the two grammars is ignored: the parser rules always will appear
before the lexer rules.
Lexer modes will require manual fix-up.
# Example
Consider the following grammar that is split.
_Input to command_
Lexer grammar in ExpressionLexer.g4:
lexer grammar ExpressionLexer;
VARIABLE : VALID_ID_START VALID_ID_CHAR* ;
fragment VALID_ID_START : ('a' .. 'z') | ('A' .. 'Z') | '_' ;
fragment VALID_ID_CHAR : VALID_ID_START | ('0' .. '9') ;
INT : ('0' .. '9')+ ;
MUL : '*' ;
DIV : '/' ;
ADD : '+' ;
SUB : '-' ;
LP : '(' ;
RP : ')' ;
WS : [ \r\n\t] + -> skip ;
Parser grammar in ExpressionParser.g4:
parser grammar ExpressionParser;
e : e ('*' | '/') e
| e ('+' | '-') e
| '(' e ')'
| ('-' | '+')* a
;
a : number | variable ;
number : INT ;
variable : VARIABLE ;
_Command_
trcombine ExpressionLexer.g4 ExpressionParser.g4 | trprint > Expression.g4
Combined grammar in Expression.g4:
grammar Expression;
e : e ('*' | '/') e
| e ('+' | '-') e
| '(' e ')'
| ('-' | '+')* a
;
a : number | variable ;
number : INT ;
variable : VARIABLE ;
VARIABLE : VALID_ID_START VALID_ID_CHAR* ;
fragment VALID_ID_START : ('a' .. 'z') | ('A' .. 'Z') | '_' ;
fragment VALID_ID_CHAR : VALID_ID_START | ('0' .. '9') ;
INT : ('0' .. '9')+ ;
MUL : '*' ;
DIV : '/' ;
ADD : '+' ;
SUB : '-' ;
LP : '(' ;
RP : ')' ;
WS : [ \r\n\t] + -> skip ;
The original grammars are left unchanged.
# Current version
0.11.0 -- Updated trkleen. Added trreplace.