public abstract class AbstractPartialContentAssistParser extends AbstractContentAssistParser implements IPartialContentAssistParser
| Constructor and Description |
|---|
AbstractPartialContentAssistParser() |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
appendTextToParse(ICompositeNode node,
int offset,
boolean skipOptional,
StringBuilder result) |
protected AbstractElement |
getEntryGrammarElement(ICompositeNode entryPoint) |
protected Collection<FollowElement> |
getFollowElements(AbstractInternalContentAssistParser parser,
AbstractElement entryPoint) |
Collection<FollowElement> |
getFollowElements(IParseResult parseResult,
int offset,
boolean strict) |
protected String |
getReplacement(ICompositeNode node)
Returns a syntactically correct replacement for nodes whose real content does not need to be parsed.
|
protected String |
getTextToParse(IParseResult parseResult,
ICompositeNode entryPoint,
int offset) |
createLexer, createParser, createTokenSource, getFollowElements, getFollowElements, getFollowElements, getInitialHiddenTokens, getRequiredRuleNameComputer, getRuleName, getUnorderedGroupHelper, setRequiredRuleNameComputer, setUnorderedGroupHelperclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetFollowElements, getFollowElementspublic Collection<FollowElement> getFollowElements(IParseResult parseResult, int offset, boolean strict)
getFollowElements in interface IPartialContentAssistParserstrict - if true
the parser will not use error recovery on the very last token of the input.protected AbstractElement getEntryGrammarElement(ICompositeNode entryPoint)
protected String getTextToParse(IParseResult parseResult, ICompositeNode entryPoint, int offset)
protected boolean appendTextToParse(ICompositeNode node, int offset, boolean skipOptional, StringBuilder result)
protected String getReplacement(ICompositeNode node)
nullprotected Collection<FollowElement> getFollowElements(AbstractInternalContentAssistParser parser, AbstractElement entryPoint)
Copyright © 2016. All Rights Reserved.