gnu.javax.swing.text.html.parser.models

Class node

Implemented Interfaces:
Serializable
Known Direct Subclasses:
list, noTagModel, PCDATAonly_model, TableRowContentModel

public class node
extends Object
implements Serializable

Part of the internal representation of the content model.
See Also:
Serialized Form

Field Summary

boolean
_closed
True for the node that cannot be visited again.
char
binary
The binary operation for this node.
node
previous
The previous node in content model (used for closing nodes).
Object
token
The token to match (can be instance of list).
char
unary
The unary opeation for this node.
int
visits
The number of times the node already was visited.

Constructor Summary

node(char binary_operator, char unary_operator, Object a_token)
Creates a new node.

Method Summary

protected void
close()
Closes this node and, if closePrevious() returs true, calls close() for the previous node.
boolean
closePrevious()
Check if closing this node means closing the previous node.
protected boolean
compare(Object a_token)
Compare the provided token object with the token object of this node.
Object
findFreeNode()
Return the token object if it could match as a next token in a token list of null if it could not.
boolean
isClosed()
Checks if this node is in the closed state.
protected void
matches()
Fire the changes that must happen then the token matches this node.
boolean
mustClose()
Check if the current situation is such that the node must be closed now.
boolean
performMatch(Object a_token)
Do the match operation with the given token.
void
reset()
Prepares the node for matching against a new list of tokens.
Object
show(Object x)
Check if the provided token can match this node.
boolean
silenceAllowed()
Check if it would be a valid case if this node is visited zero times.
String
toString()
Returns a string representation of the list.
boolean
valid()
Check if the node state is valid.
boolean
validPreliminary()

Methods inherited from class java.lang.Object

clone, equals, extends Object> getClass, finalize, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

_closed

public boolean _closed
True for the node that cannot be visited again.

binary

public char binary
The binary operation for this node.

node previous
The previous node in content model (used for closing nodes).

token

public Object token
The token to match (can be instance of list).

unary

public char unary
The unary opeation for this node.

visits

public int visits
The number of times the node already was visited.

Constructor Details

node

public node(char binary_operator,
            char unary_operator,
            Object a_token)
Creates a new node.
Parameters:
binary_operator - The operator, connecting all nodes in the list. The nodes, connected by the different operators, must be arranged into the different lists.
unary_operator - The unary operator for this node or zero if no such was specified.

Method Details

close

protected void close()
Closes this node and, if closePrevious() returs true, calls close() for the previous node.

closePrevious

public boolean closePrevious()
Check if closing this node means closing the previous node.

compare

protected boolean compare(Object a_token)
Compare the provided token object with the token object of this node.

findFreeNode

public Object findFreeNode()
Return the token object if it could match as a next token in a token list of null if it could not.
Returns:

isClosed

public boolean isClosed()
Checks if this node is in the closed state.
Returns:
True if the node is closed.

matches

protected void matches()
Fire the changes that must happen then the token matches this node.

mustClose

public boolean mustClose()
Check if the current situation is such that the node must be closed now.

performMatch

public boolean performMatch(Object a_token)
Do the match operation with the given token. This sets various flags.
Parameters:
a_token - The token to match.
Returns:
true if the the token matches node, false if it does not match or if the node is closed.

reset

public void reset()
Prepares the node for matching against a new list of tokens.

show

public Object show(Object x)
Check if the provided token can match this node. In the case of match, the node state changes, moving current position after the matched token. However if this method returns a suggested new token to insert before the provided one, the state of the list does not change.
Returns:
Boolean.TRUE if the match is found, Boolean.FALSE if the match is not possible and no token can be inserted to make the match valid. Otherwise, returns the token object that can be inserted before the last token in the list, probably (not for sure) making the match valid.

silenceAllowed

public boolean silenceAllowed()
Check if it would be a valid case if this node is visited zero times. Nodes with unary operator * or ? need not be matched to make a model valid.

toString

public String toString()
Returns a string representation of the list.
Overrides:
toString in interface Object
Returns:
String representation, similar to BNF expression.

valid

public boolean valid()
Check if the node state is valid.

validPreliminary

public boolean validPreliminary()

node.java -- Copyright (C) 2005 Free Software Foundation, Inc. This file is part of GNU Classpath. GNU Classpath is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Classpath 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 General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Classpath; see the file COPYING. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Linking this library statically or dynamically with other modules is making a combined work based on this library. Thus, the terms and conditions of the GNU General Public License cover the whole combination. As a special exception, the copyright holders of this library give you permission to link this library with independent modules to produce an executable, regardless of the license terms of these independent modules, and to copy and distribute the resulting executable under terms of your choice, provided that you also meet, for each linked independent module, the terms and conditions of the license of that module. An independent module is a module which is not derived from or based on this library. If you modify this library, you may extend this exception to your version of the library, but you are not obligated to do so. If you do not wish to do so, delete this exception statement from your version.