Gastón Bengolea Monzón zahlenteufel

#Earley Algorithm for Non-Deterministic CFG Parsing in Python

$ python earley.py "3+2*1+4"

in case it can parse the input, it outputs the Abstract Syntax Tree:

\Tree [.G [.S [.S [.S [.M [.T [.3 ]]]] [.+ ] [.M [.M [.T [.2 ]]] [.* ] [.T [.1 ]]]] [.+ ] [.M [.T [.4 ]]]] [.$ ]]

#Transitive Reduction

Given a DAG (directed acyclic graph), it computes the minimal subgraph that has the same transitive closure. This is the most comfortable way of visualizing for example a partial order (with is transitive).

Uses Graphviz to visualize the results:

	@mixin use-mobile-bottom-bar($value) {

	.bottom-navigation-buttons-container {
	display: if($value, block, none);
	}

	.navigation-buttons-container {
	display: if($value, none, block);
	}
	}

	class xxx {
	Collector<SafeHtml, SafeHtmlBuilder, SafeHtml> safeHtmlCollector =
	Collector.of(
	SafeHtmlBuilder::new,
	(BiConsumer<SafeHtmlBuilder, SafeHtml>) SafeHtmlBuilder::append,
	(builder1, builder2) -> builder1.append(builder2.toSafeHtml()),
	SafeHtmlBuilder::toSafeHtml);
	}

	#include <iostream>
	#include <cassert>

	using namespace std;

	struct node {
	int value;
	node* left;
	node* right;
	node *parent;

	#include <iostream>
	#include <stack>
	#include <algorithm>

	using namespace std;

	struct node {
	int value;
	node* left;
	node* right;

	# 1) for m in 0..n compute g_s(z_m) = mex{g(Z_i_1) xor ... xor g(z_i_j) : 0 <= i_1 < .. < i_j < m, j <=s}
	import itertools
	import operator

	n = 8
	s = 3 # s = d - 2

	def pack(idxs, n):
	return [int(i in idxs) for i in xrange(n)]

	template <typename T>
	using minheap = priority_queue<T, vector<T>, greater>;

	vector<int> kwaymerge(vector<vector<int>>& vs) {
	int k = vs.size();
	vector<int> readcount(k, 0);
	vector<int> res;
	vector<pair<int, int>> vec;
	for (int i = 0; i < k; i++) {
	if (vs[i].size() > 0){

	% Generate the points
	clf
	subplot(2,1,1);
	axis equal
	mu1 = [5 4]';
	sigma1 = [2 -0.8; -0.8 1];
	mu2 = [0 1]';
	sigma2 = [1 -0.06;-0.06 0.5];
	chol(sigma1);
	chol(sigma2); % verifica definida positiva