RegexLexer<T extends Parse > class
abstract
Constructors
RegexLexer ({dynamic stripnl = true , dynamic stripall = false , dynamic ensurenl = true , dynamic tabsize = 0 , dynamic encoding = 'guess' , dynamic debuggable = false })
Methods
autoCompleting (String errorText , String stateName )
→ List <String >
Match wid to width
errorText will be match
commonparses (Map <String , List <T > > ? currentCommon )
→ Map <String , List <T > >
You don't have to merge like this
return { ...currentCommon, your Def: bla bla bla}
just give your own lib common parse rules
=> { your Def: bla bla bla }
currentCommon is for you to check what have been loaded if Needed.
configPrint ()
→ void
expandList (List <T > parses , Map <String , List <T > > parsesMap , {List <String > ? replaceNewState })
→ Iterable <T >
getTokensUnprocessed (String text , [List <String > ? stack , Position ? pos , Map <String , List <T > > ? commondefs ])
→ Iterable <UnprocessedToken >
override
noSuchMethod (Invocation invocation )
→ dynamic
Invoked when a nonexistent method or property is accessed.
inherited
pretty (String text , [List <String > ? stack , Position ? pos , Map <String , List <T > > ? commondefs ])
→ String
printThrow (String text )
→ void
processedString ({Iterable <UnprocessedToken > ? unprocessedTokens , String ? text })
→ String
inherited
splitAutoCompleting (List <String > splitText , String stateName , {int matchMode = 3 })
→ List <String >
splitAutoCompletingMatches (List <String > splitText , String stateName , {int matchMode = 3 })
→ List <List <RegExpMatch > >
Match wd10 to width_10
matchMode:
1 // all rules match at least one splitText
2 // fast match one and don't match other splitTexts
3 // strict mode, all splitTexts must have match.
toString ()
→ String
A string representation of this object.
inherited