Home | Trees | Indices | Help |
|
---|
|
object --+ | SoupLexer
(X)HTML Tagsoup Lexer
The lexer works hard to preserve the original data. In order to achieve this goal, it does not validate the input and recognizes its input in a quite lenient way.
Instance Methods | |||
|
|||
|
|||
|
|||
|
|||
Inherited from |
Class Variables | |
Lexer states | |
---|---|
int |
CDATA = 2 Lexer state CDATA (between (P)CDATA tags) |
int |
COMMENT = 6 Lexer state COMMENT (<!--) |
int |
DECL = 8 Lexer state DECL (<!) |
int |
EMPTY = 10 Lexer state EMPTY (<>) |
int |
ENDTAG = 5 Lexer state ENDTAG (</) |
int |
FINAL = 0 Lexer state FINAL |
int |
MARKUP = 3 Lexer state MARKUP (<) |
int |
MSECTION = 7 Lexer state MSECTION (<![) |
int |
PI = 9 Lexer state PI (<?) |
int |
STARTTAG = 4 Lexer state STARTTAG (<[letter]) |
int |
TEXT = 1 Lexer state TEXT (between tags) |
Properties | |
Inherited from |
Method Details |
Initialization
|
|
Finalize the lexer This processes the rest buffer (if any)
|
|
Class Variable Details |
CDATALexer state CDATA (between (P)CDATA tags)
|
COMMENTLexer state COMMENT (<!--)
|
DECLLexer state DECL (<!)
|
EMPTYLexer state EMPTY (<>)
|
ENDTAGLexer state ENDTAG (</)
|
FINALLexer state FINAL
|
MARKUPLexer state MARKUP (<)
|
MSECTIONLexer state MSECTION (<![)
|
PILexer state PI (<?)
|
STARTTAGLexer state STARTTAG (<[letter])
|
TEXTLexer state TEXT (between tags)
|
Home | Trees | Indices | Help |
|
---|