1
83%
master: 84%

Ran 27 Feb 2025 11:26PM UTC

Files 26

Run time 0s

Badge

Embed ▾

Committed 27 Feb 2025 11:24PM UTC coverage: 83.05% (-0.6%) from 83.697%

Job # 13577849894.1

Build Type

Pull #282

github

Committed by

renatahodovan

Commit Message

Fix literal matching in parser

Ensure correct matching between grammar tree nodes and grammar
graph lexer nodes by enforcing the following conditions:

* The grammar graph node must be an UnlexerRuleNode, and the
  tree node must be an UnlexerRule.
* Their names must match, or if the tree node is named
  ('<INVALID>',), the graph node’s name must start with T__,
  indicating a constant literal.
* In the latter case, the content of the literals must also be
  compared by checking the src field of the tree node against
  the src field of the single LiteralNode neighbor in the grammar graph.

This patch ensures that this comparison is correctly applied.

Pull Request Pull Request #282: Fix literal matching in parser

Run Details

2053 of 2472 relevant lines covered (83.05%)

0.83 hits per line

renatahodovan / grammarinator / 13577849894 / 1
83%
master: 84%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 13577849894.1

renatahodovan / grammarinator / 13577849894 / 1 83% master: 84%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 13577849894.1

renatahodovan / grammarinator / 13577849894 / 1
83%
master: 84%

README BADGES
x