Patron\Compiler

Complexity

Total Complexity

14

Size/Duplication

Total Lines	156
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	3

Importance

Changes	4
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	__invoke()	0	15	1
B	parse_html_tree()	0	57	7
A	parse_html_node()	0	19	3
B	parse_expression()	0	37	3

<?php

/*
 * This file is part of the Patron package.
 *
 * (c) Olivier Laviale <olivier.laviale@gmail.com>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

namespace Patron;

class Compiler
{
	/**
	 * @param string $template
	 *
	 * @return array
	 */
	public function __invoke($template)
	{
		$parser = new HTMLParser([

			HTMLParser::T_ERROR_HANDLER => function($message, array $args) {

				throw new \Exception(\ICanBoogie\format($message, $args));
			}

		]);

		$tree = $parser->parse($template, Engine::PREFIX);

		return $this->parse_html_tree($tree);
	}

	/**
	 * @param array $tree
	 *
	 * @return array
	 */
	protected function parse_html_tree(array $tree)
	{
		$nodes = [];

		foreach ($tree as $node)
		{
			if (is_array($node))
			{
				$children = [];

				if (isset($node['children']))
				{
					$children = $this->parse_html_tree($node['children']);
				}

				$nodes[] = new ControlNode($node['name'], $node['args'], $children);
			}
			else
			{
				#
				# we don't resolve comments, unless they are Internet Explorer comments e.g. <!--[
				#

				$parts = preg_split('#(<!--(?!\[).+-->)#sU', $node, -1, PREG_SPLIT_DELIM_CAPTURE);

				if (count($parts) == 1)
				{
					$children = $this->parse_html_node($node);

					$nodes = array_merge($nodes, $children);
				}
				else
				{
					#
					# The comments, which are on odd position, are kept intact. The text, which is
					# on even position is resolved.
					#

					foreach ($parts as $i => $part)
					{
						if ($i % 2)
						{
							$nodes[] = new TextNode($part);
						}
						else
						{
							$children = $this->parse_html_node($part);

							$nodes = array_merge($nodes, $children);
						}
					}
				}
			}
		}

		return $nodes;
	}

	/**
	 * @param string $node
	 *
	 * @return array
	 * @throws \Exception
	 */
	protected function parse_html_node($node)
	{
		$nodes = [];
		$parts = preg_split(ExpressionNode::REGEX, $node, -1, PREG_SPLIT_DELIM_CAPTURE);

		foreach ($parts as $i => $part)
		{
			if ($i % 2)
			{
				$nodes[] = $this->parse_expression($part);
			}
			else
			{
				$nodes[] = new TextNode($part);
			}
		}

		return $nodes;
	}

	/**
	 * @param string $source
	 *
	 * @return object
	 * @throws \Exception
	 */
	protected function parse_expression($source)
	{
		$escape = true;

		if ($source{strlen($source) - 1} == '=')
		{
			$escape = false;
			$source = substr($source, 0, -1);
		}

		preg_match('/^(([a-z]+):)?(.+)$/', $source, $matches);

		$type = $matches[2];
		$expression = $matches[3];

		$types = [

			'' => 'Patron\EvaluateNode',
			't' => 'Patron\TranslateNode',
			'url' => 'Patron\URLNode'

		];

		if (!isset($types[$type]))
		{
			throw new \Exception(\ICanBoogie\format("Unknown expression type %type for expression %expression", [

				'type' => $type,
				'expression' => $expression

			]));
		}

		$class = $types[$type];

		return new $class($expression, $escape);
	}
}