The Parle\RLexer class

(PECL parle >= 0.5.1)

Introduction

Recursive lexer class. Any sub states can be added on the fly to match recursive patterns. Though, sometimes it might be simpler to use an instance of Parle\Lexer and define some parser.

Class synopsis

Parle\RLexer extends Parle\Lexer {
/* Constants */
const integer ICASE = 1 ;
const integer DOT_NOT_LF = 2 ;
const integer DOT_NOT_CRLF = 4 ;
const integer SKIP_WS = 8 ;
const integer MATCH_ZERO_LEN = 16 ;
/* Properties */
public boolean $bol = false ;
public integer $flags = 0 ;
public integer $state = 0 ;
/* Methods */
public void Parle\Lexer::push ( string $regex , integer $id )
public void Parle\Lexer::push ( string $state , string $regex , integer $id , string $newState )
public void Parle\Lexer::push ( string $state , string $regex , string $newState )
public int pushState ( string $state )
/* Inherited methods */
public void Parle\Lexer::push ( string $regex , integer $id )
public void Parle\Lexer::push ( string $state , string $regex , integer $id , string $newState )
public void Parle\Lexer::push ( string $state , string $regex , string $newState )
public int pushState ( string $state )
}

Predefined Constants

Parle\RLexer::ICASE

Parle\RLexer::DOT_NOT_LF

Parle\RLexer::DOT_NOT_CRLF

Parle\RLexer::SKIP_WS

Parle\RLexer::MATCH_ZERO_LEN

Properties

bol

Start of input flag.

flags

Lexer flags.

state

Current lexer state, readonly.

Table of Contents

add a note add a note

User Contributed Notes

There are no user contributed notes for this page.
To Top