# Marpa::R3 is Copyright (C) 2017, Jeffrey Kegler.
#
# This module is free software; you can redistribute it and/or modify it
# under the same terms as Perl 5.10.1. For more details, see the full text
# of the licenses in the directory LICENSES.
#
# This program is distributed in the hope that it will be
# useful, but it is provided "as is" and without any express
# or implied warranties. For details, see the full text of
# of the licenses in the directory LICENSES.
=head1 NAME
Marpa::R3::Progress - Progress reports on your parse
=head1 About this document
This document describes
the progress reports for Marpa's SLIF interface.
These allow an application to know
exactly where it is in the parse at any
point.
For parse locations of the user's choosing,
progress reports list all the productions in play,
and indicate the location at which the production started,
and how far into the production parsing has progressed.
Progress reports are extremely useful in
debugging grammars and
the detailed example in
this document is a debugging situation.
Readers specifically interested in debugging
a grammar
should read L<the document
on tracing
problems|Marpa::R3::Tracing> before
reading this document.
=head1 Introduction to Earley items
To read the
L<C<progress_show>|Marpa::R3::Scanless::R/"progress_show()">
output, it is important to have a
basic idea of what
Earley items are,
and of what the information in them means.
Everything that the user needs to know
is explained in this section.
=head2 Dotted productions
Marpa is based on Jay Earley's algorithm for parsing.
The idea behind Earley's algorithm is that you can
parse by building a table of productions
and where you are in those productions.
"Where" means two things: location in the production relative to the production's
symbols,
and location relative to the parse's input stream.
Let's look at an example of a production in a context-free grammar.
Here's the production for assignment from the Perl distribution's C<perly.y>
S<C<E<nbsp>E<nbsp>E<nbsp>E<nbsp>termbinop -E<gt> term ASSIGNOP term>>
C<ASSIGNOP> is C<perly.y>'s internal name for
the assignment operator.
In plain Perl terms, this is the "C<=>" character.
In parsing this production, we can be at any of four possible locations.
One location is at the beginning, before all of the symbols.
The other three locations are immediately after each of the production's
three symbols.
Within a production, position relative to the symbols of the production
is traditionally indicated with a dot. In fact, the symbol-relative
production position is very often called the B<dot location>. Taken as
a pair, a production and a dot location are called a B<dotted production>.
Here's our rule with a dot location indicated:
S<C<E<nbsp>E<nbsp>E<nbsp>E<nbsp>termbinop -E<gt> E<middot> term ASSIGNOP term>>
The dot location in this dotted production is at the beginning.
A dot location at the beginning of a dotted production means
that we have not recognized any symbols in the rule yet.
All we are doing is predicting that the production will occur.
A dotted production with the dot before all of its symbols is called a B<prediction>
a B<predicted production>,
or a B<predicted rule>,
.
Here's another dotted production:
S<C<E<nbsp>E<nbsp>E<nbsp>E<nbsp>termbinop -E<gt> term E<middot> ASSIGNOP term>>
In this dotted production,
we are saying we have seen a C<term>, but have not yet recognized
an C<ASSIGNOP>.
There's another special kind of dotted production, a completion.
A B<completion> (also called a B<completed rule>
or a B<completed production>
)
is a dotted production with the dot after all of the symbols.
Here is the completion for the production that we have been using as an example:
S<C<E<nbsp>E<nbsp>E<nbsp>E<nbsp>termbinop -E<gt> term ASSIGNOP term E<middot>>>
A completion indicates that a production has been fully recognized.
=head2 Earley items
The dotted productions contain
all but one piece of the information
that Marpa
needs to track.
The missing piece is the second of the two "wheres": where in the input stream.
To associate input stream location and dotted productions, Marpa uses what are now called Earley items.
A convenient way to think of an B<Earley item> is as a triple, or 3-tuple,
consisting of dotted production, origin and current location.
The B<origin> is the location in the input stream where the dotted production starts.
The B<current location> (also called the B<dot location>)
is the location in the input stream which corresponds to the
dot position.
Marpa actually has two different ideas of input stream location:
G1 location and L0 location.
G1 location is location in terms of the G1 subgrammar's Earley sets.
L0 location is location in terms of physical input,
which is also location in terms of the L0 subgrammar's Earley sets.
When the term "location" is used in this document, it means L0 location unless
otherwise indicated.
L0 location is often reported in terms of input block, line and column.
Marpa allows applications to have multiple input strings (called in this
context "blocks") but most applications will use only input block,
called C<B1>.
Two noteworthy consequences
follow from the way in which origin and current location are defined.
=over 4
=item 1.
If a dotted production is a prediction,
then origin and current location will always be the same.
=item 2.
The input stream location where a production ends is not tracked unless the
dotted production is a completion.
In other cases,
an Earley item does not tell us
if a production will
ever be completed,
much less at which location.
=back
=head1 The problem
For this example of debugging,
I have taken a very simple prototype of a string expression calculator
and deliberately introduced a problem.
I've commented out one of the correct rules:
=for Marpa::R3::Display
name: SLIF debug example, part 1
partial: 1
normalize-whitespace: 1
# <numeric assignment> ::= variable '=' <numeric expression>
=for Marpa::R3::Display::End
and replaced it with a altered one:
=for Marpa::R3::Display
name: SLIF debug example, part 1
partial: 1
normalize-whitespace: 1
<numeric assignment> ::= variable '=' expression
=for Marpa::R3::Display::End
For those readers who like to look ahead (and I encourage you to
be one of those readers)
all of the code and outputs for this example are collected in
the L</"Appendix">.
This altered rule contains an mistake of the kind that is
easy to make in actual practice.
(In this case,
a unlucky choice of naming conventions may have contributed.)
The altered version will cause problems.
In what follows, we'll pretend we don't already know
where the problem is,
and that in desk-checking the grammar our eye does not
spot the mistake, so
that we need
to use the Marpa diagnostics and tracing facilities
to "discover" it.
=head1 The example
The example we will use is a prototype string calculator.
It's extremely simple, to make the example easy to follow.
But it can be seen as a realistic example,
if it is thought of as a very
early stage in the incremental development of something useful.
=for Marpa::R3::Display
name: SLIF debug example, part 1
partial: 1
normalize-whitespace: 1
:default ::= action => ::array bless => ::lhs
:start ::= statements
statements ::= statement *
statement ::= assignment | <numeric assignment>
assignment ::= 'set' variable 'to' expression
# This is a deliberate error in the grammar
# The next line should be:
# <numeric assignment> ::= variable '=' <numeric expression>
# I have changed the <numeric expression> to <expression> which
# will cause problems.
<numeric assignment> ::= variable '=' expression
expression ::=
variable | string
|| 'string' '(' <numeric expression> ')'
|| expression '+' expression
<numeric expression> ::=
variable | number
|| <numeric expression> '*' <numeric expression>
|| <numeric expression> '+' <numeric expression>
variable ~ [\w]+
number ~ [\d]+
string ~ ['] <string contents> [']
<string contents> ~ [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}]+
:discard ~ whitespace
whitespace ~ [\s]+
=for Marpa::R3::Display::End
At this stage of developing our string calculator,
we have assignment, variables, constants, concatenation and conversion of
numerics.
For numerics, we have assignment, variables, constants, multiplication and addition.
We decide that, since string expressions and variables are the "default", that in the
grammar we'll make the symbol names for numeric assignment and expressions explicit:
C<E<lt>numeric expressionE<gt>> and C<E<lt>numeric assignmentE<gt>>.
But since strings are the default, we decide to call our string expressions simply C<E<lt>expressionE<gt>>,
and to call our string assignments simply C<E<lt>assignmentE<gt>>.
This seems like a good idea, but it is also likely to cause confusion.
For the sake of our example we will pretend that it did.
=head1 The error message
If we try the following input,
=for Marpa::R3::Display:
name: SLIF debug example, part 2
partial: 1
normalize-whitespace: 1
my $test_input = 'a = 8675309 + 42 * 711';
=for Marpa::R3::Display::End
we will get this error message,
=for Marpa::R3::Display
name: SLIF debug example error message
partial: 1
normalize-whitespace: 1
Error in SLIF parse: No lexeme found at B1L1c18
* String before error: a = 8675309 + 42\s
* The error was at B1L1c18, and at character U+002a "*", ...
* here: * 711
=for Marpa::R3::Display::End
The error message indicates that Marpa rejected the "C<*>" operator.
=head1 The value of the parse
In debugging this issue, we'll look at the value of the parse first.
The parse value differs from the other debugging aids we'll discuss.
Every other debugging tool we will describe is always available,
no matter how badly the parse failed.
But if you have a problem parsing, you often won't get a parse value.
Our luck holds.
Here's a dump of the parse value at the point of failure.
It's a nice to way to see
what Marpa thinks the parse was so far.
=for Marpa::R3::Display
name: SLIF debug example dump of value
partial: 1
normalize-whitespace: 1
\bless( [
bless( [
bless( [
'a',
'=',
bless( [
bless( [
'8675309'
], 'My_Nodes::expression' ),
'+',
bless( [
'42'
], 'My_Nodes::expression' )
], 'My_Nodes::expression' )
], 'My_Nodes::numeric_assignment' )
], 'My_Nodes::statement' )
], 'My_Nodes::statements' );
=for Marpa::R3::Display::End
If we were perceptive, we might spot the error here.
Our parse is not quite right, and that
shows up in the outer C<My_Nodes::expression> --
it should be
C<My_Nodes::numeric_expression>.
We'll assume that we don't notice this.
In fact, in the following, we'll pretend we haven't seen the
dump of the parse value.
We can't always get a parse value, so we don't want to rely on it.
=head1 Output from trace_terminals()
You can rely on getting the output from
L<C<trace_terminals>|Marpa::R3::Scanless::R/trace_terminals>,
and it is a good next place to check.
Typically, you will be interested in the last tokens
to be accepted.
Sometimes that information alone is enough to make it clear
where the problem is.
The full
L<C<trace_terminals>|Marpa::R3::Scanless::R/trace_terminals>
output for this example is in the Appendix.
We see that the recognizer accepts the input as far
as the multiplication sign ("C<*>"),
which it rejects.
In Marpa, a lexeme is "acceptable" if it fits the grammar
and the input so far.
A lexeme is rejected if it is not acceptable.
The last few lines of the C<trace_terminals> output are:
=for Marpa::R3::Display
name: SLIF debug example trace output
partial: 1
normalize-whitespace: 1
Discarded lexeme B1L1c17: whitespace
Restarted recognizer at B1L1c18
Reading codepoint "*" 0x002a at B1L1c18
Codepoint "*" 0x002a rejected as [\*] at B1L1c18
Codepoint "*" 0x002a rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c18
=for Marpa::R3::Display::End
A note in passing: Marpa shows the input string position of the tokens it accepts,
discard and rejects.
C<E<lt>whitespaceE<gt>> is supposed to be discarded
and that was what happened at line 1, column 17.
But the C<'*'> that was next in the input was rejected,
and that was not supposed to happen.
=head1 Output from progress_show()
Marpa's most powerful tool for debugging
grammars is its progress report, which
shows the
Earley items being worked on.
In the Appendix, progress reports for the entire parse are shown.
Our example in this document is a very small one,
so that producing progress reports for the entire parse is
a reasonable thing to do in this case.
If a parse is at all large, you will usually need to be selective.
The progress report that is usually of most interest is
the one for the Earley set
that you were working on when the error occurred.
This is called the B<current location>.
In our example the current location is
B1L1c17 (L0 location block 1 line 1 column 17),
which is also G1 location 5.
By default,
L<C<progress_show>|Marpa::R3::Scanless::R/"progress_show()">
prints out only the progress reports for the current location.
Here are the progress reports for
Earley set 5
(B1L1c17),
from our example.
=for Marpa::R3::Display
name: SLIF debug example progress report
partial: 1
normalize-whitespace: 1
=== Earley set 5 at B1L1c17 ===
P2 B1L1c17 statement ::= . <numeric assignment>
P3 B1L1c17 assignment ::= . 'set' variable 'to' expression
P4 B1L1c17 <numeric assignment> ::= . variable '=' expression
P20 B1L1c17 statement ::= . assignment
R11:1 B1L1c5 expression ::= expression . '+' expression; prec=0
F1 B1L1c1 [:start:] ::= statements .
F2 B1L1c1 statement ::= <numeric assignment> .
F4 B1L1c1 <numeric assignment> ::= variable '=' expression .
F5 B1L1c5 expression ::= expression .; prec=-1
F7 B1L1c15 expression ::= expression .; prec=1
F8 B1L1c15 expression ::= variable .; prec=2
F11 B1L1c5 expression ::= expression '+' expression .; prec=0
F18 B1L1c1 statements ::= statement . *
=for Marpa::R3::Display::End
=head2 Progress report lines
=for Marpa::R3::Display
name: SLIF debug example progress report
partial: 1
normalize-whitespace: 1
F1 B1L1c1 [:start:] ::= statements .
=for Marpa::R3::Display::End
The first field (in this case "C<F1>") is a rule tag --
a "type code" followed by the rule number.
In this case the "C<F1>" indicates
that this is a completed or B<final> rule,
and that it is rule number 1.
The rule number is a convenient and very brief way to refer to a rule.
After the rule tag
will be one or two fields
of location information.
If there are multiple origins for the dotted production,
there will be two fields of location information.
In the example just above there is only one field
of location information: "C<B1L1c1>".
This indicates that
the dotted production has only one origin,
and that that origin is at line 1, column 1
of block 1.
Examples of report lines with multiple origins will be given
L<below|/"Multiple instances of dotted productions">.
The last field of
each progress report line shows,
in fully expanded form,
the dotted production we were working on.
In the line just above, the fully expanded dotted production
is "C<[:start:] ::= statements .>".
Notice that
the left hand side symbol is C<[:start]>.
That is the start pseudo-symbol.
The presence of a completed start rule in our
progress report indicates that if our input had ended at Earley set 5,
it would be a valid sentence
in the language of our grammar.
(And lucky for us -- because the input at G1 location 5
was a valid sentence of the grammar,
we are able to look at the value
of the parse at location 5 for debugging purposes.)
Let's look at another progress report line:
=for Marpa::R3::Display
name: SLIF debug example progress report
partial: 1
normalize-whitespace: 1
R11:2 B1L1c5 expression ::= expression '+' . expression; prec=0
=for Marpa::R3::Display::End
Here the "C<R11:2>" indicates that this is rule number 11
(the "C<R>" stands for rule number) and that its dot
position is after the second symbol on the right hand side.
Symbol positions are numbered using the
ordinal of the symbol just before the position.
Symbols are numbered starting with 1, and
symbol position 2 is the position immediately after
symbol 2.
Note the "C<prec=0>" at the end of the above line.
The production C<expression ::= expression '+' . expression>
is one of the productions in a precedenced rule,
and "C<prec=0>" indicates that its precedence is 0.
Predicted rules also appear in progress reports:
=for Marpa::R3::Display
name: SLIF debug example progress report
partial: 1
normalize-whitespace: 1
P2 B1L1c13 statement ::= . <numeric assignment>
=for Marpa::R3::Display::End
Here the "C<P>" in the summary field means "predicted".
=head2 OK! Now to find the bug
If we look again at the progress reports
for Earley set 5, the G1 location where things went wrong,
we see that we have completed rules
for C<E<lt>expressionE<gt>>,
for C<E<lt>numeric assignmentE<gt>>,
for C<E<lt>statementE<gt>>,
and for C<E<lt>statementsE<gt>>,
as expected.
We also see two Earley items that show
that we are in the process of building another C<E<lt>expressionE<gt>>,
and that it is expecting a 'C<+>' symbol.
=head2 Why is "C<*>" not expected?
Why is the recognizer not expecting an 'C<*>' symbol?
Looking back at the grammar, we see that only one production uses
the 'C<*>' symbol.
That production is part of a precedenced rule in the DSL.
Here it is:
=for Marpa::R3::Display
name: SLIF debug example, part 1
partial: 1
normalize-whitespace: 1
<numeric expression> ::=
variable | number
|| <numeric expression> '*' <numeric expression>
|| <numeric expression> '+' <numeric expression>
=for Marpa::R3::Display::End
And here is that production as shown in the C<productions_show()> listing:
=for Marpa::R3::Display
name: SLIF debug example productions_show() output
partial: 1
normalize-whitespace: 1
R17 <numeric expression> ::= <numeric expression> '*' <numeric expression>
=for Marpa::R3::Display::End
=head2 What is happening with rule 17?
The next step is to look at the Earley items for rule 17.
But there is a problem.
We don't find any.
What is the earliest place R17
should be appearing?
The answer is that
there should be a prediction of R17 at location 0.
So we look at the predictions at location 0.
=for Marpa::R3::Display
name: SLIF debug example progress report
partial: 1
normalize-whitespace: 1
=== Earley set 0 at B1L1c1 ===
P1 B1L1c1 [:start:] ::= . statements
P2 B1L1c1 statement ::= . <numeric assignment>
P3 B1L1c1 assignment ::= . 'set' variable 'to' expression
P4 B1L1c1 <numeric assignment> ::= . variable '=' expression
P18 B1L1c1 statements ::= . statement *
P20 B1L1c1 statement ::= . assignment
=for Marpa::R3::Display::End
No R17 predicted at G1 location 0.
Next we look
through the entire progress report,
at all G1 locations,
to see if R17 is predicted anywhere.
No R17. Not anywhere.
=head2 Where is C<E<lt>numeric expressionE<gt>> expected?
The LHS of R17 is C<E<lt>numeric expressionE<gt>>.
We look in the progress report for dotted productions where
C<E<lt>numeric expressionE<gt>> is expected -- that is,
dotted productions where C<E<lt>numeric expressionE<gt>> is the post-dot symbol.
There are none.
Next we look for places in the progress reports where
C<E<lt>numeric expressionE<gt>> occurs anywhere on the RHS,
whether post-dot or not.
In the progress reports,
C<E<lt>numeric expressionE<gt>> occurs in only two dotted production instances.
Here they are:
=for Marpa::R3::Display
name: SLIF debug example progress report
partial: 1
normalize-whitespace: 1
P10 B1L1c5 expression ::= . 'string' '(' <numeric expression> ')'; prec=1
=for Marpa::R3::Display::End
=for Marpa::R3::Display
name: SLIF debug example progress report
partial: 1
normalize-whitespace: 1
P10 B1L1c15 expression ::= . 'string' '(' <numeric expression> ')'; prec=1
=for Marpa::R3::Display::End
In both cases these are predictions of a string operator, the operator we plan to
use for converting numerics to strings.
They are just predictions, predictions which go no further because there is no
'C<string>' operator in our input.
That's fine, but why no other, more relevant, occurrences of C<E<lt>numeric expressionE<gt>>?
=head2 Rules with C<E<lt>numeric expressionE<gt>> on the RHS
We look back at the grammar.
Aside for the rule for the 'C<string>' operator,
C<E<lt>numeric expressionE<gt>> occurs on a RHS in two places.
One is in the precedenced rule which defines
C<E<lt>numeric expressionE<gt>>.
=for Marpa::R3::Display
name: SLIF debug example, part 1
partial: 1
normalize-whitespace: 1
<numeric expression> ::=
variable | number
|| <numeric expression> '*' <numeric expression>
|| <numeric expression> '+' <numeric expression>
=for Marpa::R3::Display::End
This rule
will never put
C<E<lt>numeric expressionE<gt>> into the Earley items
unless there is
a C<E<lt>numeric expressionE<gt>> already there.
Nonetheless this rule is OK -- it has a job and
it's doing it.
This rule does not need fixing.
That leaves one rule to look at.
=for Marpa::R3::Display
name: SLIF debug example, part 1
partial: 1
normalize-whitespace: 1
<numeric assignment> ::= variable '=' expression
=for Marpa::R3::Display::End
This rule is one that
should lead to the prediction of a new
C<E<lt>numeric expressionE<gt>> in our example.
=head2 Problem solved
And now we see our problem.
This rule is never leading to the prediction of a new
C<E<lt>numeric expressionE<gt>>,
because there is no
C<E<lt>numeric expressionE<gt>> on its RHS,
or for that matter anywhere else in it.
On the RHS, where we wrote C<E<lt>expressionE<gt>>,
we should have written
C<E<lt>numeric expressionE<gt>>.
Change that and the problem is fixed.
=head1 Complications
We have finished our main example.
This section discusses some aspects of debugging which did not
arise in the example,
and which might be unexpected.
=head2 Empty rules
When a symbol is nulled in your parse,
L<C<progress_show>|Marpa::R3::Scanless::R/"progress_show()">
show only the nulled symbol.
It does not show the symbols expansion into rules,
or any of its nulled child symbols.
This reduces clutter,
and seems to be what programmers expect intuitively --
so much so that the absence of the nulled rules
and non-root nulled symbols
is rarely noticed.
Nonetheless, programmers working out the full details
of parses with nulled sub-trees should kept this in mind.
=head2 Input string ranges
By default,
Marpa moves forward continuously in the input string.
But Marpa applications
have the option
to move around arbitrarily in the input.
Those using the default behavior
can ignore the considerations in the rest of this section.
For the others,
Marpa allow apps to move around arbitrarily in its input.
Apps can organize the input into blocks,
which they can visit in any order or not at all.
Within blocks apps are free to jump around arbitarily
in the input.
In Marpa, it is always true that
=over 4
=item *
The first location in an input string range is the first character in L0 location
order.
(L0 location order is intrablock location within block number.)
=item *
The last location in an input string range is the last character in L0 location
order.
=back
The following statements are always true for apps
which use the default behavior.
For apps which do not use the default behavior,
they are not necessarily true.
=over 4
=item *
The first character in an input string range is the first one traversed.
=item *
The last character in an input string range is the last one traversed.
=item *
Every character in an input string range is traversed.
=item *
Every character traversed is traversed in L0 location order.
=back
=head2 Multiple instances of dotted productions
It does not happen in our main example for this document,
but a dotted production can appear in the same Earley set
more than once.
In fact, this happens frequently.
When it does happen, the lines in the progress report will look like these
=for Marpa::R3::Display
name: SLIF Leo progress_show() example
partial: 1
normalize-whitespace: 1
F2 x2 B1L1c20-44 assignment ::= <divide assignment> .
=for Marpa::R3::Display::End
=for Marpa::R3::Display
name: SLIF Leo progress_show() example
partial: 1
normalize-whitespace: 1
F6 x12 B1L1c1-L2c36 assignment ::= <plain assignment> .
=for Marpa::R3::Display::End
=for Marpa::R3::Display
name: SLIF Leo progress_show() example
partial: 1
normalize-whitespace: 1
F11 x12 B1L1c1-L2c36 <plain assignment> ::= 'x' '=' expression .
=for Marpa::R3::Display::End
=for Marpa::R3::Display
name: SLIF Leo progress_show() example
partial: 1
normalize-whitespace: 1
F13 x20 B1L1c1-L2c36 expression ::= assignment .
=for Marpa::R3::Display::End
All of these report lines are for a single Earley set.
They report dotted productions from
an indirect right recursion, one that recurses from
a C<E<lt>plain assignmentE<gt>> symbol to
an C<E<lt>expressionE<gt>> symbol, and then to
an C<E<lt>assignmentE<gt>> symbol,
before completing the recursion by returning to
a C<E<lt>plain assignmentE<gt>>.
In each of the three lines, notice that a new field appears second.
In these examples,
the second field is variously
"C<x2>", "C<x12>" or "C<x20>".
These fields are counts,
indicating the number of instances of that dotted production in
its Earley set -- in this case, that there are, respectively,
2, 12 and 20 instances of the reported dotted production.
Every dotted production instance is in the same Earley set,
that is, has the same G1 location.
Within an Earley set, an instance of the same dotted production differs
for another instance of the same dotted production
only in its origin.
The origin of a dotted production instance is the location where it begins.
Within an Earley set
the instances of a single dotted production may have many different origins --
hundreds or even more.
Each instance of a dotted production
will have its own origin in the input string.
The input string range will include them all.
=head1 Access to the "raw" progress report information
This section deals with the C<progress()> recognizer method,
which allows access to the raw progress report information.
This method is not needed for typical debugging and tracing
situations.
It is intended for applications which want to leverage
Marpa's "situational awareness" in innovative ways.
=head2 progress()
=for Marpa::R3::Display
name: SLIF progress(0) example
normalize-whitespace: 1
my $report0 = $recce->progress(0);
=for Marpa::R3::Display::End
Z<>
=for Marpa::R3::Display
name: SLIF progress() example
normalize-whitespace: 1
my $latest_report = $recce->progress();
=for Marpa::R3::Display::End
Given the G1 location (Earley set ID) as its argument,
the C<progress()> recognizer method returns a reference
to an array of "report items".
The G1 location may be given as a negative number.
An argument of I<-X>
will be interpreted as G1 location I<N-(X+1)>, where I<N> is
the latest Earley set.
This means that an argument of -1 indicates the latest
Earley set,
an argument of -2 indicates the Earley set just before
the latest one, etc.
Each report item is a triple: an array of three elements.
The three elements are, in order,
production ID, dot position, and origin.
The data returned by the two displays above,
as well as the data for the other G1 locations
in our example,
are shown L<below|"progress() outputs">.
The production ID is the same number that Marpa uses
to identify productions
in tracing and debugging output.
Given a production ID, an application can expand it into
its LHS and RHS symbols using
L<the SLIF grammar's C<production_expand()> method|Marpa::R3::Scanless::G/"production_expand()">.
Given a symbol ID,
its name and other information can be found using
L<other SLIF grammar
methods|Marpa::R3::Scanless::G/"Accessors">.
Dot position is I<N>,
where I<N> is the number of RHS symbols
successfully recognized at the G1 location of
the progress report.
Dot position is 0 for predictions.
Origin is the G1 location (Earley set ID)
at which the dotted production instance reported by
the report item began.
For a prediction, origin will always be
the same as the G1 location of the parse report.
=head2 Progress reports and efficiency
When progress reports are used for production parsing,
instead of just for debugging and tracing,
efficiency considerations become significant.
Progress reports themselves are implemented in optimized C,
and that logic is very fast.
However, the use of progress reports usually implies considerable
post-processing in Perl.
It is almost always possible to use Marpa's named events instead
of progress reports, and solutions using named events are usually
better targeted, simpler and faster.
If you do decide to use progress reports in an application,
you should be aware of the efficiency considerations when there
are right recursions in the grammar.
For most purposes,
Marpa optimizes right recursions,
so that they run in linear time.
However, to create a progress report every potential right recursion must
be fully unfolded, and at each G1 location the number of these grows linearly with the length
of the recursion.
If you are creating progress reports for more than a limited number of G1 locations,
this means processing that can become quadratic in the length of the recursion.
When a right recursion is lengthy, the cost in processing time can be serious.
If lengthy right recursions are being expanded,
this will be evident
from the parse report itself,
which will contain one report item
for every completion in the right-recursive
chain of completions.
Note that the efficiency consideration just mentioned
for expanding right recursions
is never an issue for left recursions.
Left recursions only produce at most two report
items per G1 location
and are extremely fast to process.
It is also not an issue for
Marpa's sequence rules, because sequence rules
are implemented internally as left recursions.
=head1 Appendix
Below are the code, the trace outputs
and the progress report
for the example used in this
document.
=head2 Code
=for Marpa::R3::Display:
name: SLIF debug example, part 1
normalize-whitespace: 1
my $slif_debug_source = <<'END_OF_SOURCE';
:default ::= action => ::array bless => ::lhs
:start ::= statements
statements ::= statement *
statement ::= assignment | <numeric assignment>
assignment ::= 'set' variable 'to' expression
# This is a deliberate error in the grammar
# The next line should be:
# <numeric assignment> ::= variable '=' <numeric expression>
# I have changed the <numeric expression> to <expression> which
# will cause problems.
<numeric assignment> ::= variable '=' expression
expression ::=
variable | string
|| 'string' '(' <numeric expression> ')'
|| expression '+' expression
<numeric expression> ::=
variable | number
|| <numeric expression> '*' <numeric expression>
|| <numeric expression> '+' <numeric expression>
variable ~ [\w]+
number ~ [\d]+
string ~ ['] <string contents> [']
<string contents> ~ [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}]+
:discard ~ whitespace
whitespace ~ [\s]+
END_OF_SOURCE
my $grammar = Marpa::R3::Scanless::G->new(
{
bless_package => 'My_Nodes',
source => \$slif_debug_source,
});
=for Marpa::R3::Display::End
=for Marpa::R3::Display:
name: SLIF debug example, part 2
perltidy: '-dcsc -sil=0'
my $recce = Marpa::R3::Scanless::R->new(
{ grammar => $grammar,
trace_terminals => 1,
trace_values => 1,
} );
my $test_input = 'a = 8675309 + 42 * 711' ;
my $eval_error = $EVAL_ERROR if not eval { $recce->read( \$test_input ); 1 };
$progress_report = $recce->progress_show( 0, -1 );
=for Marpa::R3::Display::End
=head2 Error message
=for Marpa::R3::Display
name: SLIF debug example error message
partial: 1
remove-display-indent: 1
remove-blank-last-line: 1
Error in SLIF parse: No lexeme found at B1L1c18
* String before error: a = 8675309 + 42\s
* The error was at B1L1c18, and at character U+002a "*", ...
* here: * 711
=for Marpa::R3::Display::End
=head2 Parse value at error location
Note that when there is a parse error, there will
not always be a parse value.
But sometimes the parse is "successful" enough, in a technical sense,
to produce a value, and in those cases examining the value can be
helpful in determining what the parser thinks it has seen so far.
=for Marpa::R3::Display
name: SLIF debug example dump of value
partial: 1
normalize-whitespace: 1
my $value_ref = $recce->value();
my $expected_output = \bless( [
bless( [
bless( [
'a',
'=',
bless( [
bless( [
'8675309'
], 'My_Nodes::expression' ),
'+',
bless( [
'42'
], 'My_Nodes::expression' )
], 'My_Nodes::expression' )
], 'My_Nodes::numeric_assignment' )
], 'My_Nodes::statement' )
], 'My_Nodes::statements' );
=for Marpa::R3::Display::End
=head2 Trace output
=for Marpa::R3::Display
name: SLIF debug example trace output
remove-display-indent: 1
remove-blank-last-line: 1
Setting trace_terminals option
Setting trace_values option to 1
Restarted recognizer at B1L1c1
Reading codepoint "a" 0x0061 at B1L1c1
Codepoint "a" 0x0061 accepted as [\w] at B1L1c1
Codepoint "a" 0x0061 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c1
Reading codepoint " " 0x0020 at B1L1c2
Codepoint " " 0x0020 rejected as [\s] at B1L1c2
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c2
Accepted lexeme B1L1c1 e1: variable; value="a"
Restarted recognizer at B1L1c2
Reading codepoint " " 0x0020 at B1L1c2
Codepoint " " 0x0020 accepted as [\s] at B1L1c2
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c2
Reading codepoint "=" 0x003d at B1L1c3
Codepoint "=" 0x003d rejected as [\=] at B1L1c3
Codepoint "=" 0x003d rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c3
Discarded lexeme B1L1c2: whitespace
Restarted recognizer at B1L1c3
Reading codepoint "=" 0x003d at B1L1c3
Codepoint "=" 0x003d accepted as [\=] at B1L1c3
Codepoint "=" 0x003d rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c3
Accepted lexeme B1L1c3 e2: '='; value="="
Restarted recognizer at B1L1c4
Reading codepoint " " 0x0020 at B1L1c4
Codepoint " " 0x0020 accepted as [\s] at B1L1c4
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c4
Reading codepoint "8" 0x0038 at B1L1c5
Codepoint "8" 0x0038 rejected as [\d] at B1L1c5
Codepoint "8" 0x0038 rejected as [\w] at B1L1c5
Codepoint "8" 0x0038 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c5
Discarded lexeme B1L1c4: whitespace
Restarted recognizer at B1L1c5
Reading codepoint "8" 0x0038 at B1L1c5
Codepoint "8" 0x0038 rejected as [\d] at B1L1c5
Codepoint "8" 0x0038 accepted as [\w] at B1L1c5
Codepoint "8" 0x0038 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c5
Reading codepoint "6" 0x0036 at B1L1c6
Codepoint "6" 0x0036 rejected as [\d] at B1L1c6
Codepoint "6" 0x0036 accepted as [\w] at B1L1c6
Codepoint "6" 0x0036 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c6
Reading codepoint "7" 0x0037 at B1L1c7
Codepoint "7" 0x0037 rejected as [\d] at B1L1c7
Codepoint "7" 0x0037 accepted as [\w] at B1L1c7
Codepoint "7" 0x0037 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c7
Reading codepoint "5" 0x0035 at B1L1c8
Codepoint "5" 0x0035 rejected as [\d] at B1L1c8
Codepoint "5" 0x0035 accepted as [\w] at B1L1c8
Codepoint "5" 0x0035 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c8
Reading codepoint "3" 0x0033 at B1L1c9
Codepoint "3" 0x0033 rejected as [\d] at B1L1c9
Codepoint "3" 0x0033 accepted as [\w] at B1L1c9
Codepoint "3" 0x0033 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c9
Reading codepoint "0" 0x0030 at B1L1c10
Codepoint "0" 0x0030 rejected as [\d] at B1L1c10
Codepoint "0" 0x0030 accepted as [\w] at B1L1c10
Codepoint "0" 0x0030 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c10
Reading codepoint "9" 0x0039 at B1L1c11
Codepoint "9" 0x0039 rejected as [\d] at B1L1c11
Codepoint "9" 0x0039 accepted as [\w] at B1L1c11
Codepoint "9" 0x0039 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c11
Reading codepoint " " 0x0020 at B1L1c12
Codepoint " " 0x0020 rejected as [\s] at B1L1c12
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c12
Accepted lexeme B1L1c5-11 e3: variable; value="8675309"
Restarted recognizer at B1L1c12
Reading codepoint " " 0x0020 at B1L1c12
Codepoint " " 0x0020 accepted as [\s] at B1L1c12
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c12
Reading codepoint "+" 0x002b at B1L1c13
Codepoint "+" 0x002b rejected as [\+] at B1L1c13
Codepoint "+" 0x002b rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c13
Discarded lexeme B1L1c12: whitespace
Restarted recognizer at B1L1c13
Reading codepoint "+" 0x002b at B1L1c13
Codepoint "+" 0x002b accepted as [\+] at B1L1c13
Codepoint "+" 0x002b rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c13
Accepted lexeme B1L1c13 e4: '+'; value="+"
Restarted recognizer at B1L1c14
Reading codepoint " " 0x0020 at B1L1c14
Codepoint " " 0x0020 accepted as [\s] at B1L1c14
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c14
Reading codepoint "4" 0x0034 at B1L1c15
Codepoint "4" 0x0034 rejected as [\d] at B1L1c15
Codepoint "4" 0x0034 rejected as [\w] at B1L1c15
Codepoint "4" 0x0034 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c15
Discarded lexeme B1L1c14: whitespace
Restarted recognizer at B1L1c15
Reading codepoint "4" 0x0034 at B1L1c15
Codepoint "4" 0x0034 rejected as [\d] at B1L1c15
Codepoint "4" 0x0034 accepted as [\w] at B1L1c15
Codepoint "4" 0x0034 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c15
Reading codepoint "2" 0x0032 at B1L1c16
Codepoint "2" 0x0032 rejected as [\d] at B1L1c16
Codepoint "2" 0x0032 accepted as [\w] at B1L1c16
Codepoint "2" 0x0032 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c16
Reading codepoint " " 0x0020 at B1L1c17
Codepoint " " 0x0020 rejected as [\s] at B1L1c17
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c17
Accepted lexeme B1L1c15-16 e5: variable; value="42"
Restarted recognizer at B1L1c17
Reading codepoint " " 0x0020 at B1L1c17
Codepoint " " 0x0020 accepted as [\s] at B1L1c17
Codepoint " " 0x0020 rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c17
Reading codepoint "*" 0x002a at B1L1c18
Codepoint "*" 0x002a rejected as [\*] at B1L1c18
Codepoint "*" 0x002a rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c18
Discarded lexeme B1L1c17: whitespace
Restarted recognizer at B1L1c18
Reading codepoint "*" 0x002a at B1L1c18
Codepoint "*" 0x002a rejected as [\*] at B1L1c18
Codepoint "*" 0x002a rejected as [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] at B1L1c18
=for Marpa::R3::Display::End
=head2 progress_show() output
=for Marpa::R3::Display
name: SLIF debug example progress report
remove-display-indent: 1
remove-blank-last-line: 1
=== Earley set 0 at B1L1c1 ===
P1 B1L1c1 [:start:] ::= . statements
P2 B1L1c1 statement ::= . <numeric assignment>
P3 B1L1c1 assignment ::= . 'set' variable 'to' expression
P4 B1L1c1 <numeric assignment> ::= . variable '=' expression
P18 B1L1c1 statements ::= . statement *
P20 B1L1c1 statement ::= . assignment
=== Earley set 1 at B1L1c3 ===
R4:1 B1L1c1 <numeric assignment> ::= variable . '=' expression
=== Earley set 2 at B1L1c5 ===
P5 B1L1c5 expression ::= . expression; prec=-1
P6 B1L1c5 expression ::= . expression; prec=0
P7 B1L1c5 expression ::= . expression; prec=1
P8 B1L1c5 expression ::= . variable; prec=2
P9 B1L1c5 expression ::= . string; prec=2
P10 B1L1c5 expression ::= . 'string' '(' <numeric expression> ')'; prec=1
P11 B1L1c5 expression ::= . expression '+' expression; prec=0
R4:2 B1L1c1 <numeric assignment> ::= variable '=' . expression
=== Earley set 3 at B1L1c13 ===
P2 B1L1c13 statement ::= . <numeric assignment>
P3 B1L1c13 assignment ::= . 'set' variable 'to' expression
P4 B1L1c13 <numeric assignment> ::= . variable '=' expression
P20 B1L1c13 statement ::= . assignment
R11:1 B1L1c5 expression ::= expression . '+' expression; prec=0
F1 B1L1c1 [:start:] ::= statements .
F2 B1L1c1 statement ::= <numeric assignment> .
F4 B1L1c1 <numeric assignment> ::= variable '=' expression .
F5 B1L1c5 expression ::= expression .; prec=-1
F6 B1L1c5 expression ::= expression .; prec=0
F7 B1L1c5 expression ::= expression .; prec=1
F8 B1L1c5 expression ::= variable .; prec=2
F18 B1L1c1 statements ::= statement . *
=== Earley set 4 at B1L1c15 ===
P7 B1L1c15 expression ::= . expression; prec=1
P8 B1L1c15 expression ::= . variable; prec=2
P9 B1L1c15 expression ::= . string; prec=2
P10 B1L1c15 expression ::= . 'string' '(' <numeric expression> ')'; prec=1
R11:2 B1L1c5 expression ::= expression '+' . expression; prec=0
=== Earley set 5 at B1L1c17 ===
P2 B1L1c17 statement ::= . <numeric assignment>
P3 B1L1c17 assignment ::= . 'set' variable 'to' expression
P4 B1L1c17 <numeric assignment> ::= . variable '=' expression
P20 B1L1c17 statement ::= . assignment
R11:1 B1L1c5 expression ::= expression . '+' expression; prec=0
F1 B1L1c1 [:start:] ::= statements .
F2 B1L1c1 statement ::= <numeric assignment> .
F4 B1L1c1 <numeric assignment> ::= variable '=' expression .
F5 B1L1c5 expression ::= expression .; prec=-1
F7 B1L1c15 expression ::= expression .; prec=1
F8 B1L1c15 expression ::= variable .; prec=2
F11 B1L1c5 expression ::= expression '+' expression .; prec=0
F18 B1L1c1 statements ::= statement . *
=for Marpa::R3::Display::End
=head2 productions_show() output
This is the C<productions_show()> output at verbosity level 3.
Usually you would use verbosity level 1 (the default),
particularly at first.
But the more verbose output is included here for illustration.
=for Marpa::R3::Display
name: SLIF debug example productions_show() output
remove-display-indent: 1
remove-blank-last-line: 1
partial: 1
R1 [:start:] ::= statements
Symbol IDs: <3> ::=
Canonical names: [:start:] ::=
R2 statement ::= <numeric assignment>
Symbol IDs: <35> ::=
Canonical names: statement ::=
R3 assignment ::= 'set' variable 'to' expression
Symbol IDs: <30> ::= <4> <39> <5>
Canonical names: assignment ::= [Lex-0] variable [Lex-1]
R4 <numeric assignment> ::= variable '=' <numeric expression>
Symbol IDs: <33> ::= <39> <6>
Canonical names: <numeric assignment> ::= variable [Lex-2]
R5 expression ::= expression; prec=-1
Symbol IDs: <31> ::=
Canonical names: expression ::=
R6 expression ::= expression; prec=0
Symbol IDs: <31> ::=
Canonical names: expression ::=
R7 expression ::= expression; prec=1
Symbol IDs: <31> ::=
Canonical names: expression ::=
R8 expression ::= variable; prec=2
Symbol IDs: <31> ::=
Canonical names: expression ::=
R9 expression ::= string; prec=2
Symbol IDs: <31> ::=
Canonical names: expression ::=
R10 expression ::= 'string' '(' <numeric expression> ')'; prec=1
Symbol IDs: <31> ::= <7> <8> <34>
Canonical names: expression ::= [Lex-3] [Lex-4] <numeric expression>
R11 expression ::= expression '+' expression; prec=0
Symbol IDs: <31> ::= <31> <10>
Canonical names: expression ::= expression [Lex-6]
R12 <numeric expression> ::= <numeric expression>; prec=-1
Symbol IDs: <34> ::=
Canonical names: <numeric expression> ::=
R13 <numeric expression> ::= <numeric expression>; prec=0
Symbol IDs: <34> ::=
Canonical names: <numeric expression> ::=
R14 <numeric expression> ::= <numeric expression>; prec=1
Symbol IDs: <34> ::=
Canonical names: <numeric expression> ::=
R15 <numeric expression> ::= variable; prec=2
Symbol IDs: <34> ::=
Canonical names: <numeric expression> ::=
R16 <numeric expression> ::= number; prec=2
Symbol IDs: <34> ::=
Canonical names: <numeric expression> ::=
R17 <numeric expression> ::= <numeric expression> '*' <numeric expression>; prec=1
Symbol IDs: <34> ::= <34> <11>
Canonical names: <numeric expression> ::= <numeric expression> [Lex-7]
R18 statements ::= statement *
Symbol IDs: <36> ::=
Canonical names: statements ::=
R19 <numeric expression> ::= <numeric expression> '+' <numeric expression>; prec=0
Symbol IDs: <34> ::= <34> <10>
Canonical names: <numeric expression> ::= <numeric expression> [Lex-6]
R20 statement ::= assignment
Symbol IDs: <35> ::=
Canonical names: statement ::=
R21 [:lex_start:] ~ [:discard:]
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R22 [:lex_start:] ~ 'set'
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R23 [:lex_start:] ~ 'to'
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R24 [:lex_start:] ~ '='
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R25 [:lex_start:] ~ 'string'
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R26 [:lex_start:] ~ '('
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R27 [:lex_start:] ~ ')'
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R28 [:lex_start:] ~ '+'
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R29 [:lex_start:] ~ '*'
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R30 [:lex_start:] ~ number
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R31 [:lex_start:] ~ string
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R32 [:lex_start:] ~ variable
Symbol IDs: <2> ::=
Canonical names: [:lex_start:] ::=
R33 'set' ~ [s] [e] [t]
Symbol IDs: <4> ::= <28> <22>
Canonical names: [Lex-0] ::= [[s]] [[e]]
R34 'to' ~ [t] [o]
Symbol IDs: <5> ::= <29>
Canonical names: [Lex-1] ::= [[t]]
R35 '=' ~ [\=]
Symbol IDs: <6> ::=
Canonical names: [Lex-2] ::=
R36 'string' ~ [s] [t] [r] [i] [n] [g]
Symbol IDs: <7> ::= <28> <29> <27> <24> <25>
Canonical names: [Lex-3] ::= [[s]] [[t]] [[r]] [[i]] [[n]]
R37 '(' ~ [\(]
Symbol IDs: <8> ::=
Canonical names: [Lex-4] ::=
R38 ')' ~ [\)]
Symbol IDs: <9> ::=
Canonical names: [Lex-5] ::=
R39 '+' ~ [\+]
Symbol IDs: <10> ::=
Canonical names: [Lex-6] ::=
R40 '*' ~ [\*]
Symbol IDs: <11> ::=
Canonical names: [Lex-7] ::=
R41 variable ~ [\w] +
Symbol IDs: <39> ::=
Canonical names: variable ::=
R42 number ~ [\d] +
Symbol IDs: <32> ::=
Canonical names: number ::=
R43 string ~ ['] <string contents> [']
Symbol IDs: <37> ::= <12> <38>
Canonical names: string ::= [[']] <string contents>
R44 <string contents> ~ [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}] +
Symbol IDs: <38> ::=
Canonical names: <string contents> ::=
R45 [:discard:] ~ whitespace
Symbol IDs: <1> ::=
Canonical names: [:discard:] ::=
R46 whitespace ~ [\s] +
Symbol IDs: <40> ::=
Canonical names: whitespace ::=
=for Marpa::R3::Display::End
=head2 symbols_show() output
=for Marpa::R3::Display
name: SLIF debug example symbols_show() output
remove-display-indent: 1
remove-blank-last-line: 1
partial: 1
S1 [:discard:]
Canonical name: [:discard:]
DSL name: [:discard:]
S2 [:lex_start:]
Canonical name: [:lex_start:]
DSL name: [:lex_start:]
S3 [:start:]
Canonical name: [:start:]
DSL name: [:start:]
S4 'set'
Canonical name: [Lex-0]
DSL name: 'set'
S5 'to'
Canonical name: [Lex-1]
DSL name: 'to'
S6 '='
Canonical name: [Lex-2]
DSL name: '='
S7 'string'
Canonical name: [Lex-3]
DSL name: 'string'
S8 '('
Canonical name: [Lex-4]
DSL name: '('
S9 ')'
Canonical name: [Lex-5]
DSL name: ')'
S10 '+'
Canonical name: [Lex-6]
DSL name: '+'
S11 '*'
Canonical name: [Lex-7]
DSL name: '*'
S12 [']
Canonical name: [[']]
DSL name: [']
S13 [\(]
Canonical name: [[\(]]
DSL name: [\(]
S14 [\)]
Canonical name: [[\)]]
DSL name: [\)]
S15 [\*]
Canonical name: [[\*]]
DSL name: [\*]
S16 [\+]
Canonical name: [[\+]]
DSL name: [\+]
S17 [\=]
Canonical name: [[\=]]
DSL name: [\=]
S18 [\d]
Canonical name: [[\d]]
DSL name: [\d]
S19 [\s]
Canonical name: [[\s]]
DSL name: [\s]
S20 [\w]
Canonical name: [[\w]]
DSL name: [\w]
S21 [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}]
Canonical name: [[^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}]]
DSL name: [^'\x{0A}\x{0B}\x{0C}\x{0D}\x{0085}\x{2028}\x{2029}]
S22 [e]
Canonical name: [[e]]
DSL name: [e]
S23 [g]
Canonical name: [[g]]
DSL name: [g]
S24 [i]
Canonical name: [[i]]
DSL name: [i]
S25 [n]
Canonical name: [[n]]
DSL name: [n]
S26 [o]
Canonical name: [[o]]
DSL name: [o]
S27 [r]
Canonical name: [[r]]
DSL name: [r]
S28 [s]
Canonical name: [[s]]
DSL name: [s]
S29 [t]
Canonical name: [[t]]
DSL name: [t]
S30 assignment
Canonical name: assignment
DSL name: assignment
S31 expression
Canonical name: expression
DSL name: expression
S32 number
Canonical name: number
DSL name: number
S33 <numeric assignment>
Canonical name: <numeric assignment>
DSL name: numeric assignment
S34 <numeric expression>
Canonical name: <numeric expression>
DSL name: numeric expression
S35 statement
Canonical name: statement
DSL name: statement
S36 statements
Canonical name: statements
DSL name: statements
S37 string
Canonical name: string
DSL name: string
S38 <string contents>
Canonical name: <string contents>
DSL name: string contents
S39 variable
Canonical name: variable
DSL name: variable
S40 whitespace
Canonical name: whitespace
DSL name: whitespace
=for Marpa::R3::Display::End
=head2 progress() outputs
These section contains samples of
the output of the C<progress()>
method -- the progress reports in their "raw" format.
The output is shown in L<Data::Dumper> format,
with C<Data::Dumper::Indent> set to 0
and C<Data::Dumper::Terse> set to 1.
The C<Data::Dumper> output from L<C<progress()>|/"progress()"> at G1 location 0:
=for Marpa::R3::Display
name: SLIF progress() output at location 0
remove-display-indent: 1
remove-blank-last-line: 1
[[1,0,0],[2,0,0],[3,0,0],[4,0,0],[18,0,0],[20,0,0]]
=for Marpa::R3::Display::End
The C<Data::Dumper> output from L<C<progress()>|/"progress()"> at G1 location 1:
=for Marpa::R3::Display
name: SLIF progress() output at location 1
remove-display-indent: 1
remove-blank-last-line: 1
[[4,1,0]]
=for Marpa::R3::Display::End
The C<Data::Dumper> output from L<C<progress()>|/"progress()"> at location 2:
=for Marpa::R3::Display
name: SLIF progress() output at location 2
remove-display-indent: 1
remove-blank-last-line: 1
[[4,2,0],[5,0,2],[6,0,2],[7,0,2],[8,0,2],[9,0,2],[10,0,2],[11,0,2]]
=for Marpa::R3::Display::End
The default L<C<progress()>|/"progress()"> output is for the latest Earley set.
Here is the L<C<progress()>|/"progress()"> output for the latest Earley set.
=for Marpa::R3::Display
name: SLIF progress() output at default location
remove-display-indent: 1
remove-blank-last-line: 1
[[1,1,0],[2,0,5],[2,1,0],[3,0,5],[4,0,5],[4,3,0],[5,1,2],[7,1,4],[8,1,4],[11,1,2],[11,3,2],[18,1,0],[20,0,5]]
=for Marpa::R3::Display::End
=head1 COPYRIGHT AND LICENSE
=for Marpa::R3::Display
ignore: 1
Marpa::R3 is Copyright (C) 2017, Jeffrey Kegler.
This module is free software; you can redistribute it and/or modify it
under the same terms as Perl 5.10.1. For more details, see the full text
of the licenses in the directory LICENSES.
This program is distributed in the hope that it will be
useful, but without any warranty; without even the implied
warranty of merchantability or fitness for a particular purpose.
=for Marpa::R3::Display::End
=cut
# vim: expandtab shiftwidth=4: