net.sourceforge.plantuml.tim.expression.TokenStack Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-lgpl Show documentation
Show all versions of plantuml-lgpl Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
* |
* | PlantUML : a free UML diagram generator
* |
* +=======================================================================
*
* (C) Copyright 2009-2024, Arnaud Roques
*
* Project Info: https://plantuml.com
*
* If you like this project or if you find it useful, you can support us at:
*
* https://plantuml.com/patreon (only 1$ per month!)
* https://plantuml.com/liberapay (only 1€ per month!)
* https://plantuml.com/paypal
*
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* PlantUML 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 Lesser General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library. If not, see tokens;
public TokenStack() {
this(new ArrayList());
}
private TokenStack(List list) {
this.tokens = list;
}
public int size() {
return tokens.size();
}
public TokenStack subTokenStack(int i) {
return new TokenStack(Collections.unmodifiableList(tokens.subList(i, tokens.size())));
}
@Override
public String toString() {
return tokens.toString();
}
public void add(Token token) {
this.tokens.add(token);
}
public TokenStack withoutSpace() {
final TokenStack result = new TokenStack();
for (Token token : tokens)
if (token.getTokenType() != TokenType.SPACES)
result.add(token);
return result;
}
static public TokenStack eatUntilCloseParenthesisOrComma(Eater eater) throws EaterException {
final TokenStack result = new TokenStack();
int level = 0;
Token lastToken = null;
while (true) {
eater.skipSpaces();
final char ch = eater.peekChar();
if (ch == 0)
throw new EaterException("until001", eater.getStringLocated());
if (level == 0 && (ch == ',' || ch == ')'))
return result;
final Token token = TokenType.eatOneToken(lastToken, eater, false);
final TokenType type = token.getTokenType();
if (type == TokenType.OPEN_PAREN_MATH)
level++;
else if (type == TokenType.CLOSE_PAREN_MATH)
level--;
if (token.getTokenType() != TokenType.SPACES)
lastToken = token;
result.add(token);
}
}
static public void eatUntilCloseParenthesisOrComma(TokenIterator it, StringLocated location)
throws EaterException {
int level = 0;
while (true) {
final Token ch = it.peekToken();
if (ch == null)
throw new EaterException("until002", location);
final TokenType typech = ch.getTokenType();
if (level == 0 && (typech == TokenType.COMMA || typech == TokenType.CLOSE_PAREN_MATH)
|| typech == TokenType.CLOSE_PAREN_FUNC)
return;
final Token token = it.nextToken();
final TokenType type = token.getTokenType();
if (type == TokenType.OPEN_PAREN_MATH || type == TokenType.OPEN_PAREN_FUNC)
level++;
else if (type == TokenType.CLOSE_PAREN_MATH || type == TokenType.CLOSE_PAREN_FUNC)
level--;
}
}
private int countFunctionArg(TokenIterator it, StringLocated location) throws EaterException {
// return 42;
final TokenType type1 = it.peekToken().getTokenType();
if (type1 == TokenType.CLOSE_PAREN_MATH || type1 == TokenType.CLOSE_PAREN_FUNC)
return 0;
int result = 1;
while (it.hasMoreTokens()) {
eatUntilCloseParenthesisOrComma(it, location);
final Token token = it.nextToken();
final TokenType type = token.getTokenType();
if (type == TokenType.CLOSE_PAREN_MATH || type == TokenType.CLOSE_PAREN_FUNC)
return result;
else if (type == TokenType.COMMA)
result++;
else
throw new EaterException("count13", location);
}
throw new EaterException("count12", location);
}
public void guessFunctions(StringLocated location) throws EaterException {
final Deque open = new ArrayDeque<>();
final Map parens = new HashMap();
for (int i = 0; i < tokens.size(); i++) {
final Token token = tokens.get(i);
if (token.getTokenType().equals(TokenType.OPEN_PAREN_MATH))
open.addFirst(i);
else if (token.getTokenType().equals(TokenType.CLOSE_PAREN_MATH))
parens.put(open.pollFirst(), i);
}
// System.err.println("before=" + toString());
// System.err.println("guessFunctions2" + parens);
for (Map.Entry ids : parens.entrySet()) {
final int iopen = ids.getKey();
final int iclose = ids.getValue();
assert tokens.get(iopen).getTokenType() == TokenType.OPEN_PAREN_MATH;
assert tokens.get(iclose).getTokenType() == TokenType.CLOSE_PAREN_MATH;
if (iopen > 0 && tokens.get(iopen - 1).getTokenType() == TokenType.PLAIN_TEXT) {
tokens.set(iopen - 1, new Token(tokens.get(iopen - 1).getSurface(), TokenType.FUNCTION_NAME, null));
final int nbArg = countFunctionArg(subTokenStack(iopen + 1).tokenIterator(), location);
tokens.set(iopen, new Token("" + nbArg, TokenType.OPEN_PAREN_FUNC, null));
tokens.set(iclose, new Token(")", TokenType.CLOSE_PAREN_FUNC, null));
}
}
// System.err.println("after=" + toString());
}
class InternalIterator implements TokenIterator {
private int pos = 0;
public Token peekToken() {
return tokens.get(pos);
}
public Token nextToken() {
if (hasMoreTokens() == false)
return null;
return tokens.get(pos++);
}
public boolean hasMoreTokens() {
return pos < tokens.size();
}
}
public TokenIterator tokenIterator() {
return new InternalIterator();
}
public TValue getResult(StringLocated location, TContext context, TMemory memory) throws EaterException {
final Knowledge knowledge = context.asKnowledge(memory, location.getLocation());
final TokenStack tmp = withoutSpace();
tmp.guessFunctions(location);
final TokenIterator it = tmp.tokenIterator();
final ShuntingYard shuntingYard = new ShuntingYard(it, knowledge, location);
final ReversePolishInterpretor rpn = new ReversePolishInterpretor(location, shuntingYard.getQueue(), knowledge,
memory, context);
return rpn.getResult();
}
}