More strict search for patterns within RQG output.

Registered by Matthias Leich

util/simplify-grammar.pl allows to assign patterns of the RQG output we are searching for.
Current algorithm:
   Success for current simplification in case all assigned patterns occur somewhere within the RQG log.
Disadvantage: This algorithm tends to "false" success judgement.
Proposed algorithm:
     Rightmost refers to file and not to line.
     Search for rightmost position where <pattern n+1> occurs
     Found: No --> no success of simplification attempt
                    Yes --> Check if this position is after the rightmost position where <pattern n> occured
                                   No -> no success of simplification attempt because the order is wrong
                                   Yes -> Search for rightmost position where <pattern n+2> occurs
                                                 .....

Blueprint information

Status:
Not started
Approver:
None
Priority:
Medium
Drafter:
None
Direction:
Needs approval
Assignee:
Matthias Leich
Definition:
New
Series goal:
None
Implementation:
Unknown
Milestone target:
None

Related branches

Sprints

Whiteboard

The priority will have to be increased as soon as we meet a case where we have a significant likelihood
that the simplification process judges wrong.
This applies mostly to RQG tests with threads > 1 ,

(?)

Work Items

This blueprint contains Public information 
Everyone can see this information.

Subscribers

No subscribers.