This page is the reference document for the recognizer objects of Marpa's SLIF (Scanless interface).

The Scanless interface is so-called because it does not require the application to supply a scanner (lexer). The SLIF contains its own lexer, one whose use is integrated into its syntax. In this document, use of the SLIF's internal scanner is called internal scanning.

The SLIF allows applications that find it useful to do their own scanning. When an application bypasses the SLIF's internal scanner and does its own scanning, this document calls it external scanning. An application can use external scanning to supplement internal scanning, or to replace the SLIF's internal scanner entirely.

The recognizer reads a virtual input stream. By default, this is identical to a physical input stream. The physical input stream is a Perl string passed as the first argument to the $recce->read() method method. Once set by the read() method, the physical input stream cannot be changed.

Physical input stream location is simply the Perl pos() location in the physical input string. Physical input stream location may be zero, but is never negative.

Virtual input streams complicate the idea of parse location, but they are essential for some applications. Implementing the C language's pre-processor directives requires either two passes, or a virtual approach to the input. And Perl here-documents cannot be parsed correctly by an application which insists on moving forward serially in the input. The SLIF allows applications to skip backward and forward in the physical input stream, and to read sections of the stream repeatedly.

Input streams are ordered sets of characters, and the locations in them are represented as the integers from 0 to N, where N+1 is the size of the set. In this document, we will refer to ordered subsets of contiguous locations as either ranges or spans.

A range is an ordered set of contiguous locations specified by start location and end location: [S ... E]. A range is a subset of a "universe" -- some larger ordered set of locations 0 to N. In this document the larger sets, or universes, will be either physical input streams or G1 location streams.

The start and end locations of the range refer to locations in its universe. Negative locations refer to a locations relative to the end of the range's universe, so that -1 refers to the last location of the universe, -2 refers to the second-to-last location of the universe, etc.

A span is an ordered set of contiguous locations specified by start location and length: [S, L]. A span is a subset of a universe of locations, as was described above for ranges.

The range corresponding to the span [S, L] is [S ... (S+L)-1]. The span corresponding to the range [S ... E] is [S, (S-E)+1]. A span with a negative length is interpreted as if it was the range with that same pair of values.

In general, spans are more convenient for programming. But when fencepost issues are important, spans require a lot of mental arithmetic, and a discussion that uses ranges is easier to follow.

As examples,

The entire input stream is the range [0 ... -1] and the span [0, -1].

The first 42 characters of the input stream are the range [0 ... 41] and the span [0, 42].

The entire input stream, except for the last character, is the range [0 ... -2] and the span [0, -2].

The substring consisting only of the last character is the range [-1 ... -1] and the span [-1, 1].

The substring which consists of the last 3 characters is the range [-3 ... -1] and the span [-3, 3].

The substring which consists of only the third-to-last character is the range [-3 ... -3] and the span [-3, 1].

The virtual input stream is a series of input strings. An input string is a substring of the physical input stream. By default the virtual input stream consists of exactly one input string, one which begins at location 0 in the physical input stream and whose length is the length of the physical input stream.

The SLIF always starts scanning using the read() method, and the first input string is specified, implicitly or explicitly, by the read() method. When not specified, the input string for read() defaults to the range [0 ... -1].

read() will return success when it reaches the end of its input string, or when a SLIF parse event triggers. (Parse events are described in a separate document.) In many cases there are no parse events declared, or none trigger. If no parse event triggers and the parse does not fail, then read() will read to the end of string.

The SLIF tracks a current location in the physical input stream. On return from the read() method, current location will depend on the reason for the return. If a SLIF parse event triggered, the current location will be the trigger location; otherwise the current location will be at the end of the input string.

The read() method may only be called once for a recognizer, but internal scanning can be resumed with the resume() method. The resume() method, as the name suggests, resumes the internal scanning with a new input string. This input string must always be a substring of the physical input stream that was specified to the read() method. By default, the new input string runs from the current location to the end of the physical input stream.

On successful return from the resume() method, the current location is set in the same way as it for the read() method: the trigger location, if an event triggered; otherwise, the end of string. The resume() method may be called repeatedly, until the application considers the virtual input stream complete. More details are in the reference descriptions of the read() and resume() methods, below.

When the application considers input complete, and is ready to produce a parse value, the $recce->value() method method is used. In most cases, this is all that is needed. But Marpa also allows repeated passes over the same input with different settings. More details on the semantics are provided in a separate document.

For error message and other purposes, even externally scanned lexemes are required to correspond to a span of the input stream. An external scanner must set up a relationship to the input stream, even if that relationship is completely artificial.

Here is one very general way to deal with external lexemes which have no natural mapping into the physical input stream. We will call what would ordinarily be the input string, the "natural input". To form the physical input stream, we append these 7 characters: "NO TEXT". For example, if the natural input is "Hi! I am the real input", then the physical input stream will be

"Hi! I am the real inputNO TEXT"

To read the natural input, we will use an initial call to the read() method of the form $recce->read($input_string, -8). If we want to read a lexeme which has no real relationship to the natural input, we can read it externally, using a method call similar to $recce->lexeme_read($symbol_name, -7, -1, $value).

In addition to input stream location, the SLIF also tracks G1 location. G1 locations run from 0 to N, where N+1 is the length of the input stream. The conventions and notation for numbering G1 locations and for describing G1 spans and ranges are the same as for input stream locations.

G1 location can be ignored most of the time, but it does become relevant when tracing the G1 grammar, and when dealing with ambiguous terminals. (For those familiar with Marpa's internals, the G1 location is the G1 Earley set index.)

Because lexemes may be ambiguous, more than one lexeme may be read at a single G1 location. We can think of the lexemes read at a single G1 location as a set -- call it the G1 lexeme set, or, for brevity, the G1 set. If a lexeme is unambiguous, its G1 set will contain exactly one lexeme.

G1 location can be thought of as location in terms of boundaries of G1 sets, so that the the first G1 set starts at G1 location 0 and ends at G1 location 1. When we speak of a G1 set at G1 location L, we refer to the G1 set ending at G1 location L. That means that there is no G1 set at G1 location 0.

As each G1 set is read, G1 location increases by one. G1 length is length calculated in terms of G1 locations. For example, if a span of G1 locations which begin at G1 location 42 and has length 2, it will contain a pair of G1 locations: G1 location 42 and G1 location 43.

Sometimes it is convenient to think of a G1 location as corresponding to a single input stream location. When this is the case, what is meant is the location at the end of physical input stream span: $span_start+$span_length.

It is sometimes useful to find the literal substring of the physical input stream which corresponds to a span of G1 locations. If an application reads the physical stream in sequence within the G1 span, Marpa "does what you mean". For more complicated cases, the exact rules are described in this section.

Except for G1 location zero, every G1 location X corresponds to one or more characters in the physical input stream. Let [s(X) ... e(X)] be the physical input stream range that corresponds to G1 location X. Only two things are guaranteed about s(X) and e(X) as a function of X:

s(X) and e(X) are not defined when X is zero.

It will always be the case that s(X) <= e(X).

In mapping ranges of G1 locations to ranges of physical input stream locations, there are several complications:

There is a fencepost versus interval issue: physical input stream locations correspond to characters, but G1 locations are locations before and after characters.

Both kinds of locations are zero-based, but G1 location 0 does not corresponds to a range in the physical input stream.

Scanning is allowed to skip backward and forward, so the mapping of G1 location to physical stream locations is not necessarily monotonic. For example, if X and Y are G1 locations such that X < Y, it is possible that s(X) > e(Y).

Repeated scanning of the same physical input stream locations is allowed, as well as overlaps. For example, if X and Y are G1 locations, it is possible that s(X) < s(Y) < e(X) < e(Y).

Even when there is a monotonic function from G1 location to physical input stream span, there will usually be gaps. For example, applications typically discard whitespace. This means that if W is the physical input stream location of a whitespace character, there will be no G1 location X such that s(X) <= W <= e(X).

To cope with these situations, the following rules are used when translating G1 locations into literal substrings of the physical input stream.

If [X ... Y] is a G1 range, and s(X) < e(Y), the literal will be substring made of the characters in the physical input stream range [s(X) ... e(Y)].

If s(X) >= e(Y), the literal will be the empty string.

For applications which read the physical input stream in lexical order, without skipping forward, the above rules will work as expected. For other applications, the above may be "close enough". But some applications may want to use custom logic to reassemble the input from the physical input stream. The "literal()" method can assist in this process.

This describes the life cycle of a recognizer which has only one parse series. Your recognizer has only one parse series unless it calls the series_restart() method. Use of multiple parse series is an advanced technique, one which most applications will not need. Full details about parse series are in a separate document.

The Initial Phase begins when the recognizer is created with the calls the new() method. It ends when the read() method is called. It will also end, of course, if the recognizer is destroyed, but most applications will want to continue into the next phase. Very little can happen in this phase. It is possible to change some recognizer settings using the set() method.

The Reading Phase of a recognizer begins when it calls the read() method. It ends when it first calls the value() method. The Reading Phase will also end, of course, if the recognizer is destroyed, but most applications will want to continue into the next phase. During this phase, it is possible to add other input strings to the virtual input, by calling the resume() method.

The Evaluation Phase of a SLIF recognizer begins when it first calls the value() method, which returns the result of the first parse tree. If there were no parses, the value() method will return a Perl undef.

The value() method may be called more than once during the Evaluation Phase. The second and later calls of the value() method will return the result of the next parse tree. When there are no more parse trees, the value() method will return a Perl undef The resume() method should not be called during Evaluation Phase.

In the above, we have described the life cycle for recognizers which have only one parse series. A recognizer will have only one parse series, unless it calls the series_restart() method.

Using multiple parse series, an application can run the SLIF recognizer several times on the same virtual input stream. More detail about the recognizer's life cycle, including a full treatment of parse series, is in a separate document.

The recognizer settings are the named arguments accepted by the recognizer setting-aware methods. The recognizer setting-aware methods are the new(), set() and series_restart() methods. Not every recognizer setting-aware method accepts all of the settings. The details are given below, by setting.

Most users will not need this setting. The end setting specifies the parse end, as a G1 location. The default is for the parse to end where the input did, so that the parse returned is of the entire virtual input stream. The end setting is only allowed in the new() and series_restart() methods.

The event_is_active recognizer setting changes the activation setting of events. Its value should be a reference to a hash, in which the key of every entry is an event name, and its value is either 0 or 1. If the value is 1, the event named in the hash key will be activated when the recognizer starts. If the value is 0, the event named in the hash key will be inactive when the recognizer starts. The event_is_active setting is only allowed with the recognizer's new() method.

The setting in the event_is_active hash overrides the activation setting in the grammar. The setting will be in effect before events at earleme 0 are triggered, and before any of the input stream is read. The activate() method can also be used to change an event's activation setting for events that trigger after earleme 0. But events at earleme 0 trigger during the recognizer's new() method -- they can not be affected by calls of the activate() method.

If an event is initialized to inactive in the grammar, the event_is_active recognizer setting is the only way for a recognizer to allow that event to be active at earleme 0. Similarly, if an event is initialized to active in the grammar, the event_is_active recognizer setting is the only way for a recognizer to set that event to be inactive at earleme 0.

The exhaustion recognizer setting determines what happens when asynchronous parse exhaustion occurs. Intuitively, "asynchronous" parse exhaustion is parse exhaustion at a point when control would not normally return to the application. The exhaustion setting is allowed in any call of any of the recognizer setting-aware methods. For details see the description of exhaustion parse events.

The value of the exhaustion recognizer setting must be either "fatal" or "event". "fatal" is the default. If the value is "fatal", asynchronous parse exhaustion is treated as an error, and an exception is thrown. If the value is "event", an event occurs as described in the section on exhaustion parse events.

The value of the grammar setting must be a SLIF grammar object. The new() method is required to have a grammar setting. The grammar setting is only allowed by the new() method. Once the recognizer is created, the grammar cannot be changed.

If non-zero, causes a fatal error when that number of parse results is exceeded. max_parses is useful to limit CPU usage and output length when testing and debugging. Stable and production applications may prefer to count the number of parses, and take a less Draconian response when the count is exceeded.

The value must be an integer. If it is zero, there will be no limit on the number of parse results returned. The default is for there to be no limit. The max_parses setting is valid in all calls of the recognizer setting-aware methods.

The ranking_method is only allowed in calls of the new() method. The value must be a string: one of "none", "rule", or "high_rule_only". When the value is "none", Marpa returns the parse results in arbitrary order. This is the default.

The "rule" and "high_rule_only" ranking methods allows the user to control the order in which parse results are returned by the value method, and to exclude some parse results from the parse series. For details, see the document on parse order.

The rejection recognizer setting determines what happens when all tokens are rejected by the G1 parser. The rejection setting is allowed in any call of any of the recognizer setting-aware methods. The value must be either "fatal" or "event". "fatal" is the default.

If the value is "fatal", rejection of all tokens is treated as an error, and an exception is thrown. If the value is "event", an event occurs as described in the section on rejection parse events.

Sets the semantic package for the recognizer. This setting takes precedence over any package implied by the blessing of the per-parse arguments to the SLIF recognizer's value() method. The semantics_package recognizer setting is used when resolving action names to fully qualified Perl names. For more details on the SLIF semantics, see the document on SLIF semantics.

The too_many_earley_items setting is optional, and very few applications will need it. If specified, it sets the Earley item warning threshold to a value other than its default. If an Earley set becomes larger than the Earley item warning threshold, a recognizer event is generated, and a warning is printed to the trace file handle.

Marpa parses from any BNF, and can handle grammars and inputs which produce very large Earley sets. But parsing that involves very large Earley sets can be slow.

By default, Marpa calculates an Earley item warning threshold for the G1 recognizer based on the size of the G1 grammar, and for each L0 recognizer based on the size of the L0 grammar. The default thresholds will never be less than 100. The default is the result of considerable experience and almost all users will be happy with it.

If the Earley item warning threshold is changed from its default, the change applies to both L0 and G1 -- currently there is no way to set them separately. If the Earley item warning threshold is set to 0, no recognizer event is generated, and warnings about large Earley sets are turned off. An Earley item threshold warning almost always indicates a serious issue, and turning these warnings off will rarely be something that an application wants to do.

The too_many_earley_items setting is allowed in any call of any of the recognizer setting-aware methods.

If non-zero, traces the lexemes -- those tokens passed from the L0 parser to the G1 parser. This recognizer setting is the best way to follow what the L0 parser is doing, and it is also very helpful for tracing the G1 parser. The trace_terminals setting is allowed in any call of any of the recognizer setting-aware methods.

The value of the trace_values setting is a numeric trace level. If the numeric trace level is 1, Marpa prints tracing information as values are computed in the evaluation stack. A trace level of 0 turns value tracing off, which is the default. Traces are written to the trace file handle. The trace_values setting is allowed in any call of any of the recognizer setting-aware methods.

The value is a file handle. Trace output and warning messages go to the trace file handle. By default, the trace file handle is inherited from the grammar. The trace_file_handle setting is allowed in any call of any of the recognizer setting-aware methods.

The new() method is the constructor for SLIF recognizers. The arguments to the new() constructor must be one or more hashes of named arguments, where each hash key is a recognizer setting. The grammar recognizer setting is required. All other recognizer settings are optional. For more on recognizer settings, see the section describing them.

This method should be called after the read() method. If there is exactly one parse, it returns the empty string. If there is no parse, it returns a non-empty string indicating that fact. If there are two or more parses, it returns a non-empty string describing the ambiguity.

Applications should only test the returned string to see if it is empty or non-empty. The non-empty strings are intended only for reading by humans -- their exact format is subject to change.

When ambiguous() detects an ambiguous parse, it puts the recognizer into "forest mode", so that it can examine the parse. As long as the recognizer is in forest mode, calls to the value() method will produce fatal errors. Forest mode can be cleared using the series_restart() method. This will start a new parse series in "tree mode", which will allow calls to the value() method to succeed.

Given a pointer to a physical input stream and, optionally, a span specifying an input string within it, read() parses the input string according to the grammar. read() returns success if it parses to the end of the input string, or if it triggers a SLIF parse event. Only a single call to read() is allowed for a SLIF recognizer.

The first argument of read() is a pointer to the physical input stream which, by default, will be exactly the same as the virtual input stream. To specify the input string, read() recognizes optional second and third arguments and treats them as the start and length of a span of the physical input stream. The default start location is zero. The default length is -1. Negative locations and lengths are interpreted as described above.

If a SLIF parse event occurs during the read() method, the current location is set to the trigger location. SLIF parse events are described in detail in a separate document. If no SLIF parse event triggers, and the parse reaches the end of the input string without a failure, the current location is set to the end of the input string.

On success, read() returns the current physical input stream location. This value may be zero. The call is considered successful if it reaches the end of input string, or if a SLIF parse event triggers. On failure, read() throws an exception.

The series_restart() method ends the current parse series, and starts another. Parse series are described in another document. The series_restart() method allows, as optional arguments, hashes whose key-value pairs are recognizer settings.

The series_restart() method cannot change the grammar recognizer setting. If any other recognizer setting is not specified explicitly, it is reset to its default. If an application wants an explicit recognizer setting to persist into a new parse series, it must specify that setting explicitly in the new parse series. series_restart() is particularly useful with the end and semantics_package named arguments.

The series_restart() method must be called before value() when ambiguous() detects an ambiguous parse and the application needs to get the parse values.

This method allows recognizer settings to be changed after a SLIF grammar is created. The arguments to set() must be one or more hashes whose key-value pairs are recognizer settings and their values. The allowed recognizer settings are described above.

The value method call evaluates the next parse tree in the parse series, and returns a reference to the parse result for that parse tree. If there are no more parse trees, the value method returns undef. There are zero parse trees if there was no valid parse of the input according to the grammar. There will be more than one parse tree if the parse was ambiguous.

The value() method allows one optional argument. If provided, the argument explicitly specifies the per-parse argument for the parse tree. This per-parse argument can be a Perl scalar of any type, but the most useful type for a per-parse argument is a reference (blessed or unblessed) to a hash or to an array. The per-parse argument, if provided, will be the first argument of all Perl semantics closures. When data does not conveniently fit into the bottom-up flow of parse tree evaluation, the per-parse argument is useful for sharing it within the tree. Symbol tables are one example of the kind of data which parses often require, but which it is not convenient to accumulate bottom-up.

If the semantics_package setting of the SLIF recognizer was not specified, Marpa will use the package into which the per-parse argument was blessed as the semantics package. (As a reminder, the semantics package is the package in which Marpa looks for the parse's Perl semantic closures.)

When the per-parse argument of the value() method is the source of the semantics package, all calls to the value() method in the same parse series must have a per-parse argument that specifies the same semantics package. More precisely, if the per-parse argument of the first call of the value() method in a parse series is the source of the semantics package, it will be a fatal error if any subsequent value() call in that parse series

The activate() method allows the recognizer to deactivate and reactivate SLIF parse events. SLIF parse events are described in a separate document.

The activate() method takes two arguments. The first is the name of an event, and the second (optional) argument is 0 or 1. If the argument is 0, the event is deactivated. If the argument is 1, the event is activated. An argument of 1 is the default. Since an SLIF recognizer always starts with all defined events activated, 0 will probably be more common as the second argument to activate()

Though they are not reported until the call of the read() method, location 0 events are triggered in the SLIF recognizer's constructor, before the activate() method can be called. Currently there is no way to deactivate location zero events.

The overhead imposed by events can be reduced by using the activate() method. But making many calls to the activate() method purely for efficiency purposes will be counter-productive. Also, deactivated events still impose some overhead, so if an event is never used, it should be commented out in the SLIF DSL.

The lexeme_alternative() method allows an external scanner to read ambiguous tokens. Most applications will prefer the simpler lexeme_read().

lexeme_alternative() takes one or two arguments. The first argument, which is required, is the name of a symbol to be read at the current location. The second argument, which is optional, is the value of the symbol. The value argument is interpreted as described for lexeme_read().

Any number of tokens may be read using lexeme_alternative() without advancing the current location. This allows an application to use ambiguous tokens. To complete reading at a G1 location, and advance the current G1 location to the next G1 location, use the lexeme_complete() method.

On success, returns a non-negative number, which may be zero. Returns undef if the token was rejected. Failures are thrown as exceptions.

The lexeme_complete() method allows an external scanner to read ambiguous tokens. It completes the reading of a set of tokens specified by one or more calls of the lexeme_alternative() method at a G1 location. Most applications will prefer the simpler lexeme_read() method.

The lexeme_complete() method requires two arguments, which represent the start and length parameters of a span in the physical input stream. The span is interpreted, and G1 location and current input stream location are adjusted, as described for the lexeme_read() method.

Return value: On success, lexeme_complete() returns the new current location. This will never be location zero, because a succesful call of lexeme_complete() always advances the location. Failure is thrown as an exception.

The lexeme_read() method reads a single, unambiguous, lexeme. It takes four arguments, only the first of which is required. The first argument is the lexeme's symbol name. The second and third arguments specify the span in the physical input stream. The last argument specifies the value of the lexeme.

In the span specified by the second and third arguments, the start location defaults to the current location. If the pause span is defined, and the start of the pause lexeme is the same as the current location, length defaults to the length of the pause span. Otherwise length defaults to -1. Negative values are allowed and are interpreted as described above.

The span will be interpreted as the section of the physical input stream that corresponds to the current G1 set. (As a reminder, the G1 set consists of the tokens read at single G1 location.) This correspondence between the span and the token may be artificial, but a span is defined for every token, even if only by default.

The fourth argument specifies the lexeme value. The lexeme value plays an important role in the SLIF's semantics. More details on the SLIF's semantics are in a document dedicated to them. If the fourth argument is omitted, the lexeme value will be a string containing the corresponding substring of the input stream. Omitting the value argument does not have the same effect as passing an explicit Perl undef. If the value argument is an explicit Perl undef, the lexeme value will be a Perl undef.

Non-lexeme SLIF parse events may trigger during the lexeme_read() method. Lexeme SLIF parse events are ignored because they are designed to allow switching over to external scanning, and make no sense when external scanning is already in progress. SLIF parse events are described in detail in a separate document.

Current input stream location will be set to $start+$length. If a SLIF parse event triggers, current input stream location will be set to the trigger location. Currently the trigger location and $start+$length will always be the same, but that may change.

When successful, lexeme_read() advances the current G1 location by one. The token read by lexeme_read() will start at the previous G1 location and end at the new current G1 location. The new current location in the input stream will be at the end location of the new lexeme.

On success, lexeme_read() returns the new current physical input stream location. This will never be location zero, because lexemes cannot be zero length. If the token was rejected, lexeme_read() returns a Perl undef. Failure is thrown as an exception.

The resume() method resumes the SLIF's internal scanning, as described above. A physical input stream must already have been specified using the $recce->read() method. The resume() method should only be called during the Reading Phase.

The resume() method takes two optional arguments, which represent the start and length parameters of a span in the physical input stream. The default start location is the current location. The default length is -1. Negative arguments are interpreted as described above.

If a SLIF parse event occurs during the read() method, the current location is set to the trigger location. SLIF parse events are described in detail in a separate document. If no SLIF parse event triggers, and the parse reaches the end of the input string without a failure, the current location is set to the end of the input string.

resume() is considered successful if it reads input to the end of input string, or if a SLIF parse event triggers. On success, resume() returns the new current location. On unthrown failure, resume() returns a Perl undef. Currently, all failures are thrown.

Succeeds and returns 1 if there was an unambiguous parse, in other words if there was exactly one parse tree. Succeeds and returns 2 or greater if the parse was ambiguous, in other words if there was more than one parse tree. Succeeds and returns 0 if there are no parse trees, because parsing failed. Currently, all other failures are thrown.

When the return value is 2 or greater, the return value is not necessarily the parse count. Instead, it is a value which is subject to change. and on which an application should not rely. The intent was that, some day, return values of 2 or greater would represent a "metric" which was cheap to compute, but which estimated the degree of ambiguity in some useful way. The best metric is, of course, would be the exact parse count, but determining that is expensive.

The events() method takes no arguments, and returns an array of SLIF parse event descriptors. It returns the empty array if there were no event.

SLIF parse events are described in detail in a separate document. Each SLIF parse event descriptor is a reference to an array of one or more elements. The first element of every named event descriptor is a string containing the name of the event. Typically the name of the event is only element. Other elements will be as described for each type of parse event.

Any other SLIF recognizer mutator may clear the events. It is expected that an application interested in events will call the events() method immediately after the event-triggering event.

The exhausted method returns a Perl true if parsing in a SLIF recognizer is exhausted, and a Perl false otherwise. Parsing is exhausted when the recognizer will not accept any further input.

Marpa usually "does what you mean" in case of parse exhaustion, but this method allows the recognizer's exhaustion status to be discovered directly. Parse exhaustion is discussed in detail in a separate document.

G1 locations do not correspond to a single input stream location, but to a span of them. The g1_location_to_span() method returns an array of two elements, representing a span in the physical input stream. G1 location 0 does not correspond to a input stream span so, as a special case, the input stream span for G1 location 0 is returned as (0,0).

Given the name of a symbol, last_completed() returns the 2-element array that is the G1 location span of the most recent match. If there was more than one most recent match, it returns the longest. If there was no match, last_completed() returns the empty array in array context and a Perl false in scalar context.

Returns the most recent input stream span for a completed instance of the symbol name that is its first and only argument. That argument is required. The search for a completed instance of a symbol can only succeed if the first argument is the name of the LHS symbol of some rule in the grammar. For details on how the input stream span is determined, see "Literals and G1 spans".

If more than one instance of the symbol ends at the same location, last_completed_span() returns the longest span. If there is no symbol instance for the argument symbol, last_completed_span() returns the empty array. Other failures are thrown.

The line_column() method accepts one, optional, argument: a location in the input stream. The location defaults to the current location. line_column() returns the corresponding line and column position, as a 2-element array. The first element of the array is the line position, and the second element is the column position.

Numbering of lines and columns is 1-based, following UNIX editor tradition. Except at EOVS (the end of the virtual input stream), the line and column will be that of an actual character. At EOVS the line number will be that of the last line, and the column number will be that of the last column plus one. Applications which want to treat EOVS as a special case can test for it using the pos() method and the input_length() method.

A line is considered to end with any newline sequence as defined in the Unicode Specification 4.0.0, Section 5.8. Specifically, a line ends with one of the following:

Use of this method is discouraged. New applications should avoid it. Instead the lexeme event should be declared as a named event. The named lexeme event can be set up in such a way that it uniquely identifies the lexeme that triggered it. SLIF parse events are described in detail in a separate document.

The pause_lexeme() method accepts no arguments. It returns the current pause lexeme. More than one lexeme may trigger at the same location, in which case the choice of pause lexeme is made arbitrarily. This is one reason that the use of pause_lexeme() is discouraged. pause_lexeme() returns a Perl undef when the pause lexeme is undefined.

The pause_span() method accepts no arguments, and returns the pause span as a 2-element array: start and length. The "pause span" is described in detail in another document. pause_span() returns a Perl undef if the pause span is undefined.

Returns a reference to an array that describes the progress of a parse at a location. With no argument, progress() reports progress at the current location. If a G1 location is given as its argument, progress() reports progress at that G1 location. Negative G1 locations are interpreted as described above.

The progress reports returned by the progress() method identify rules by their G1 rule ID. G1 rule IDs can be converted to a list of the rule's symbols using the rule() method of the SLIF grammar. Details on progress reports can be found in their own document.

Returns a string showing the progress of the G1 parse. For a description of its output, see Marpa::R2::Progress. With no arguments, the string contains reports for the current location.

Locations can be specified as arguments to show_progress(). With a single integer argument N, the string contains reports for G1 location N. Two numeric arguments are interpreted as a span of G1 locations, and the returned string contains reports for all locations in the span. For example, the method call $recce->show_progress(0, -1) will print progress reports for the entire parse.

The arguments are G1 locations instead of physical input stream locations, because G1 locations represent a unique point in the parse. By contrast, a single physical input stream location might be visited many times by a SLIF recognizer.

The output is intended only for reading by humans. The exact format is subject to change and should not be relied on by applications.

Given a G1 span -- that is, a G1 start location and a length in G1 locations -- the substring() method returns a substring of the input stream. A G1 length of zero will produce the zero-length string.

The substring of the input stream is determined on the assumption that the application reads the input in lexical order and without gaps except for whitespace and other normal discards. When this is not the case, the substring is determined as described above.

Returns a reference to a list of strings, where the strings are the names of the lexemes acceptable at the current location. The presence of a lexeme in this list means that lexeme will be acceptable in the next call of the resume() method. This is highly useful for Ruby Slippers parsing. A more fine-tuned approach is to identify the lexemes of interest and create "predicted symbol" events for them.

Some lexemes are specified in the G1 rules of the DSL as quoted strings or as character classes, This is convenient, but the lexemes created in this way do not have real names. Instead, internal names, like [Lex-1] are created for them, and these are what appear in the list of strings returned by terminals_expected(). If an application wants a quoted string or a character class to have a mnemonic name, the application must provide that name explicitly, by specifying the character class or quoted string in an L0 rule.

Use of this method is discouraged in favor of the more efficient events() method. The event() method requires one argument, an event index. It returns a descriptor of the named event with that index, or a Perl undef if there is no such event. For more details on events, see the description of the events() method.

Use of this method is discouraged in favor of "last_completed()". Given the name of a symbol, last_completed_range() returns the G1 start and G1 end locations of the most recent match. If there was more than one most recent match, last_completed_range() returns the longest. If there was no match, last_completed_range() returns the empty array in array context and a Perl false in scalar context.

Use of this method is discouraged in favor of "substring()". Given a G1 start and a G1 end location, range_to_string() returns the substring of the input stream that is between the two. The range_to_string() method assumes that the application read the physical input stream in lexical order and without gaps except for whitespace and other normal discards. When that is not the case, range_to_string() behaves in much the same way as described above for "substring()".

Copyright 2015 Jeffrey Kegler
This file is part of Marpa::R2. Marpa::R2 is free software: you can
redistribute it and/or modify it under the terms of the GNU Lesser
General Public License as published by the Free Software Foundation,
either version 3 of the License, or (at your option) any later version.
Marpa::R2 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. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser
General Public License along with Marpa::R2. If not, see
http://www.gnu.org/licenses/.