import FrontCalculatorParserToken from "./front.calculator.parser.token";
import FrontCalculatorSymbolNumber from "../symbol/front.calculator.symbol.number";
import FrontCalculatorSymbolOpeningBracket from "../symbol/brackets/front.calculator.symbol.opening.bracket";
import FrontCalculatorSymbolClosingBracket from "../symbol/brackets/front.calculator.symbol.closing.bracket";
import FrontCalculatorSymbolFunctionAbstract from "../symbol/abstract/front.calculator.symbol.function.abstract";
import FrontCalculatorSymbolOperatorAbstract from "../symbol/abstract/front.calculator.symbol.operator.abstract";
import FrontCalculatorSymbolSeparator from "../symbol/front.calculator.symbol.separator";
import FrontCalculatorParserNodeSymbol from "./node/front.calculator.parser.node.symbol";
import FrontCalculatorParserNodeContainer from "./node/front.calculator.parser.node.container";
import FrontCalculatorParserNodeFunction from "./node/front.calculator.parser.node.function";

/**
 * The parsers has one important method: parse()
 * It takes an array of tokens as input and
 * returns an array of nodes as output.
 * These nodes are the syntax tree of the term.
 *
 */
export default class FrontCalculatorParser {
	/**
	 *
	 * @param {FrontCalculatorSymbolLoader} symbolLoader
	 */
	constructor(symbolLoader) {

		/**
		 *
		 * @type {FrontCalculatorSymbolLoader}
		 */
		this.symbolLoader = symbolLoader;
	}

	/**
	 * Parses an array with tokens. Returns an array of nodes.
	 * These nodes define a syntax tree.
	 *
	 * @param {FrontCalculatorParserToken[]} tokens
	 *
	 * @returns FrontCalculatorParserNodeContainer
	 */
	parse(tokens) {
		var symbolNodes = this.detectSymbols(tokens);

		var nodes = this.createTreeByBrackets(symbolNodes);

		nodes = this.transformTreeByFunctions(nodes);

		this.checkGrammar(nodes);

		// Wrap the nodes in an array node.
		return new FrontCalculatorParserNodeContainer(nodes);
	}

	/**
	 * Creates a flat array of symbol nodes from tokens.
	 *
	 * @param {FrontCalculatorParserToken[]} tokens
	 * @returns {FrontCalculatorParserNodeSymbol[]}
	 */
	detectSymbols(tokens) {
		var symbolNodes = [];
		var symbol      = null;
		var identifier  = null;

		var expectingOpeningBracket = false; // True if we expect an opening bracket (after a function name)
		var openBracketCounter      = 0;

		for (var i = 0; i < tokens.length; i++) {
			var token = tokens[i];
			var type  = token.type;

			if (FrontCalculatorParserToken.TYPE_WORD === type) {
				identifier = token.value;
				symbol     = this.symbolLoader.find(identifier);

				if (null === symbol) {
					throw ('Error: Detected unknown or invalid string identifier: ' + identifier + '.');
				}
			} else if (type === FrontCalculatorParserToken.TYPE_NUMBER) {
				// Notice: Numbers do not have an identifier
				var symbolNumbers = this.symbolLoader.findSubTypes(FrontCalculatorSymbolNumber);

				if (symbolNumbers.length < 1 || !(symbolNumbers instanceof Array)) {
					throw ('Error: Unavailable number symbol processor.');
				}

				symbol = symbolNumbers[0];
			} else {// Type Token::TYPE_CHARACTER:
				identifier = token.value;
				symbol     = this.symbolLoader.find(identifier);
				if (null === symbol) {
					throw ('Error: Detected unknown or invalid string identifier: ' + identifier + '.');
				}

				if (symbol instanceof FrontCalculatorSymbolOpeningBracket) {
					openBracketCounter++;
				}
				if (symbol instanceof FrontCalculatorSymbolClosingBracket) {
					openBracketCounter--;

					// Make sure there are not too many closing brackets
					if (openBracketCounter < 0) {
						throw ('Error: Found closing bracket that does not have an opening bracket.');
					}
				}

			}

			if (expectingOpeningBracket) {
				if (!(symbol instanceof FrontCalculatorSymbolOpeningBracket)) {
					throw ('Error: Expected opening bracket (after a function) but got something else.');
				}

				expectingOpeningBracket = false;
			} else {
				if (symbol instanceof FrontCalculatorSymbolFunctionAbstract) {
					expectingOpeningBracket = true;
				}
			}

			var symbolNode = new FrontCalculatorParserNodeSymbol(token, symbol);

			symbolNodes.push(symbolNode);
		}

		// Make sure the term does not end with the name of a function but without an opening bracket
		if (expectingOpeningBracket) {
			throw ('Error: Expected opening bracket (after a function) but reached the end of the term');
		}

		// Make sure there are not too many opening brackets
		if (openBracketCounter > 0) {
			throw ('Error: There is at least one opening bracket that does not have a closing bracket');
		}

		return symbolNodes;
	}

	/**
	 * Expects a flat array of symbol nodes and (if possible) transforms
	 * it to a tree of nodes. Cares for brackets.
	 * Attention: Expects valid brackets!
	 * Check the brackets before you call this method.
	 *
	 * @param {FrontCalculatorParserNodeSymbol[]} symbolNodes
	 * @returns {FrontCalculatorParserNodeAbstract[]}
	 */
	createTreeByBrackets(symbolNodes) {
		var tree               = [];
		var nodesInBracket     = []; // AbstractSymbol nodes inside level-0-brackets
		var openBracketCounter = 0;

		for (var i = 0; i < symbolNodes.length; i++) {
			var symbolNode = symbolNodes[i];

			if (!(symbolNode instanceof FrontCalculatorParserNodeSymbol)) {
				throw ('Error: Expected symbol node, but got "' + symbolNode.constructor.name + '"');
			}

			if (symbolNode.symbol instanceof FrontCalculatorSymbolOpeningBracket) {
				openBracketCounter++;

				if (openBracketCounter > 1) {
					nodesInBracket.push(symbolNode);
				}
			} else if (symbolNode.symbol instanceof FrontCalculatorSymbolClosingBracket) {
				openBracketCounter--;

				// Found a closing bracket on level 0
				if (0 === openBracketCounter) {
					var subTree = this.createTreeByBrackets(nodesInBracket);

					// Subtree can be empty for example if the term looks like this: "()" or "functioname()"
					// But this is okay, we need to allow this so we can call functions without a parameter
					tree.push(new FrontCalculatorParserNodeContainer(subTree));
					nodesInBracket = [];
				} else {
					nodesInBracket.push(symbolNode);
				}
			} else {
				if (0 === openBracketCounter) {
					tree.push(symbolNode);
				} else {
					nodesInBracket.push(symbolNode);
				}
			}
		}

		return tree;
	}

	/**
	 * Replaces [a SymbolNode that has a symbol of type AbstractFunction,
	 * followed by a node of type ContainerNode] by a FunctionNode.
	 * Expects the $nodes not including any function nodes (yet).
	 *
	 * @param {FrontCalculatorParserNodeAbstract[]} nodes
	 *
	 * @returns {FrontCalculatorParserNodeAbstract[]}
	 */
	transformTreeByFunctions(nodes) {
		var transformedNodes   = [];
		var functionSymbolNode = null;

		for (var i = 0; i < nodes.length; i++) {
			var node = nodes[i];

			if (node instanceof FrontCalculatorParserNodeContainer) {
				var transformedChildNodes = this.transformTreeByFunctions(node.childNodes);

				if (null !== functionSymbolNode) {
					var functionNode = new FrontCalculatorParserNodeFunction(transformedChildNodes, functionSymbolNode);
					transformedNodes.push(functionNode);
					functionSymbolNode = null;
				} else {
					// not a function
					node.childNodes = transformedChildNodes;
					transformedNodes.push(node);
				}
			} else if (node instanceof FrontCalculatorParserNodeSymbol) {
				var symbol = node.symbol;
				if (symbol instanceof FrontCalculatorSymbolFunctionAbstract) {
					functionSymbolNode = node;
				} else {
					transformedNodes.push(node);
				}
			} else {
				throw ('Error: Expected array node or symbol node, got "' + node.constructor.name + '"');
			}

		}

		return transformedNodes;
	}

	/**
	 * Ensures the tree follows the grammar rules for terms
	 *
	 * @param {FrontCalculatorParserNodeAbstract[]} nodes
	 */
	checkGrammar(nodes) {
		// TODO Make sure that separators are only in the child nodes of the array node of a function node
		// (If this happens the calculator will throw an exception)

		for (var i = 0; i < nodes.length; i++) {
			var node = nodes[i];
			if (node instanceof FrontCalculatorParserNodeSymbol) {
				var symbol = node.symbol;

				if (symbol instanceof FrontCalculatorSymbolOperatorAbstract) {
					var posOfRightOperand = i + 1;

					// Make sure the operator is positioned left of a (potential) operand (=prefix notation).
					// Example term: "-1"
					if (posOfRightOperand >= nodes.length) {
						throw ('Error: Found operator that does not stand before an operand.');
					}

					var posOfLeftOperand = i - 1;

					var leftOperand = null;

					// Operator is unary if positioned at the beginning of a term
					if (posOfLeftOperand >= 0) {
						leftOperand = nodes[posOfLeftOperand];

						if (leftOperand instanceof FrontCalculatorParserNodeSymbol) {
							if (leftOperand.symbol instanceof FrontCalculatorSymbolOperatorAbstract  // example 1`+-`5 : + = operator, - = unary
							    || leftOperand.symbol instanceof FrontCalculatorSymbolSeparator // example func(1`,-`5) ,= separator, - = unary
							) {
								// Operator is unary if positioned right to another operator
								leftOperand = null;
							}
						}
					}

					// If null, the operator is unary
					if (null === leftOperand) {
						if (!symbol.operatesUnary) {
							throw ('Error: Found operator in unary notation that is not unary.');
						}

						// Remember that this node represents a unary operator
						node.setIsUnaryOperator(true);
					} else {
						if (!symbol.operatesBinary) {
							console.log(symbol);
							throw ('Error: Found operator in binary notation that is not binary.');
						}
					}
				}
			} else {
				this.checkGrammar(node.childNodes);
			}
		}
	}
}.tx-content-switcher-toggle-switch-label{position:relative;display:inline-block;width:60px;height:34px}.tx-content-switcher-toggle-switch-label input{opacity:0;width:0;height:0}.tx-content-switcher-toggle-switch-slider{position:absolute;cursor:pointer;top:0;left:0;right:0;bottom:0;background-color:#ccc;-webkit-transition:.4s;transition:.4s;display:block;border-style:solid}.tx-content-switcher-toggle-switch-slider:before{position:absolute;content:"";height:26px;width:26px;left:0;top:50%;transform:translateY(-50%);background-color:#fff;-webkit-transition:.4s;transition:.4s}input:checked+.tx-content-switcher-toggle-switch-slider{background-color:#2196f3}input:focus+.tx-content-switcher-toggle-switch-slider{box-shadow:0 0 1px #2196f3}input:checked+.tx-content-switcher-toggle-switch-slider:before{-webkit-transform:translate(34px,-50%);-ms-transform:translate(34px,-50%);transform:translate(34px,-50%)}.tx-content-switcher-toggle-inner{display:flex;align-items:center;flex-direction:row;padding:30px 0}.tx-content-switcher-toggle.tx_switecher_left{justify-content:flex-start;display:flex}.tx-content-switcher-toggle.tx_switecher_center{justify-content:center;display:flex}.tx-content-switcher-toggle.tx_switecher_right{justify-content:flex-end;display:flex}.tx-content-switcher-toggle.tx_switecher_justify{display:block}.tx-content-switcher-toggle.tx_switecher_justify .tx-content-switcher-toggle-inner{justify-content:center}.tx-content-switcher-toggle-label-1,.tx-content-switcher-toggle-label-2{cursor:pointer}{"id":1884,"date":"2025-03-06T09:27:56","date_gmt":"2025-03-06T09:27:56","guid":{"rendered":"https:\/\/makemyasset.in\/?p=1884"},"modified":"2025-03-06T09:27:56","modified_gmt":"2025-03-06T09:27:56","slug":"find-your-perfect-fuck-friend-today","status":"publish","type":"post","link":"https:\/\/makemyasset.in\/?p=1884","title":{"rendered":"Find your perfect fuck friend today"},"content":{"rendered":"<h1>Find your perfect fuck friend today<\/h1>\n<p>Looking for a way to find an amazing fuck buddy? search no further compared to internet! websites like tinder and grindr provide a variety of choices for finding someone to have a blast with. whether you are looking for a one-time thing or something more severe, these platforms will allow you to find an ideal individual for you personally. naturally, don&#8217;t assume all website is ideal for everybody. this is exactly why it is necessary to be selective when trying to find a fuck buddy. make certain to find a niche site that fits your passions and character. if you are searching for a niche site that provides many options, tinder is definitely the platform available. with an increase of than 50 million users, tinder provides users the power to search by location, age, and also interests. with grindr, you are able to relate solely to other gay and bisexual men. this permits you to find somebody who shares your passions and life style. no matter which site you select, make sure to be safe and respectful when engaging in sexual tasks. keep in mind, no real matter what, always use protection whenever sex. and, naturally, continually be honest together with your fuck buddy by what you are looking for. in that way, you could have the best possible experience.<\/p>\n<h2>Get started with all the best lesbian dating sites<\/h2>\n<p>Are you shopping for a lesbian dating website that caters especially for your requirements? if so, you&#8217;ve arrive at the right spot. here, we are going to expose you to some of the best lesbian dating sites on the web. websites like these offer lesbian singles a safe and supportive environment in which to get in touch along with other women. they also offer features that make online dating easier, such as chat and messaging abilities. so what are you currently waiting for? start searching these amazing lesbian dating sites today!<\/p>\n<h2>Find the best online adult dating sites<\/h2>\n<p>When it comes to locating a night out together, people move to cyberspace. sites like match.com and eharmony provide many different features, including the ability to search by location, age, and passions. however, which online dating site could be the best? to find the best online adult dating sites, you need to determine that which you&#8217;re looking for. do you want a site that offers a large pool of prospective times, or would you like a website which more centered on relationships? once you decide what you want, you need to look at the features each website offers. finally, you&#8217;ll want to look at the price of utilising the website. some sites are free to make use of, while some charge a fee.<\/p>\n<h2>Discover the best sites allowing you to connect with singles<\/h2>\n<p>When it comes down to finding someone, many people move to the <a href=\"https:\/\/www.abestdating.com\/\" target=\"_blank\" rel=\"noopener\">visit this finding love on the internet web-site<\/a> match.com and eharmony offer a variety of tools and services to greatly help singles find both. however, not absolutely all web sites are created equal. in this specific article, we will have a look at the best sex sites allowing you to connect with singles. 1. adult buddy finder<\/p>\n<p>adult friend finder is one of the oldest and a lot of popular internet sites for connecting with singles. the internet site provides a number of tools and solutions, including a dating area. furthermore, adult buddy finder offers a number of features to really make the dating procedure easier. for example, the web site has a messaging system that enables users to talk to each other. 2. okcupid<\/p>\n<p>okcupid is another popular site for connecting with singles. in addition, okcupid provides a variety of tools to simply help users discover the perfect partner. for example, the internet site has a search function that enables users to find singles predicated on their interests. 3. tinder<\/p>\n<p>tinder is a dating software that has become popular in the last several years. the app allows users in order to connect along with other users that have comparable passions. 4. horny singles<\/p>\n<p>horny singles is a web site that is targeted on connecting singles who&#8217;re searching for sex. 5. best sex sites provide a variety of features to greatly help singles relate solely to both. whether you are looking for a dating website or a website that gives sex, they&#8217;re the best sites for connecting with singles.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Find your perfect fuck friend today Looking for a way to find an amazing fuck buddy? search no further compared to internet! websites like tinder and grindr provide a variety of choices for finding someone to have a blast with. whether you are looking for a one-time thing or something more severe, these platforms will [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"categories":[305],"tags":[],"class_list":["post-1884","post","type-post","status-publish","format-standard","hentry","category-blog"],"acf":[],"_links":{"self":[{"href":"https:\/\/makemyasset.in\/index.php?rest_route=\/wp\/v2\/posts\/1884","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/makemyasset.in\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/makemyasset.in\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/makemyasset.in\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/makemyasset.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1884"}],"version-history":[{"count":1,"href":"https:\/\/makemyasset.in\/index.php?rest_route=\/wp\/v2\/posts\/1884\/revisions"}],"predecessor-version":[{"id":1885,"href":"https:\/\/makemyasset.in\/index.php?rest_route=\/wp\/v2\/posts\/1884\/revisions\/1885"}],"wp:attachment":[{"href":"https:\/\/makemyasset.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1884"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/makemyasset.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1884"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/makemyasset.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1884"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}