| /** | |
| * LL(1) parser. Building parsing table, part 1: First and Follow sets. | |
| * | |
| * NOTICE: see full implementation in the Syntax tool, here: | |
| * https://github.com/DmitrySoshnikov/syntax/blob/master/src/sets-generator.js | |
| * | |
| * by Dmitry Soshnikov <dmitry.soshnikov@gmail.com> | |
| * MIT Style License | |
| * | |
| * An LL(1)-parser is a top-down, fast predictive non-recursive parser, |
| package main | |
| import ( | |
| "fmt" | |
| "net" | |
| "os" | |
| "syscall" | |
| ) | |
| const ( |
| // | |
| // __SINGLETON_HPP__ | |
| // | |
| // The MIT License (MIT) | |
| // Copyright (c) <2013> <Jiang Bian jbian@uams.edu> | |
| // Permission is hereby granted, free of charge, to any person obtaining a copy | |
| // of this software and associated documentation files (the "Software"), to deal | |
| // in the Software without restriction, including without limitation the rights |
This is not intended to be comprehensive or authoritative, just free online resources I've found valuable while learning more about Erlang.
| import re, sys # this file requires python 3 | |
| def parse(tokens): | |
| stack = ([], None) | |
| for t in tokens: | |
| if t == '(': | |
| stack = ([], stack) | |
| elif t == ')': | |
| (finished_list, stack) = stack | |
| stack[0].append(finished_list) | |
| elif not t.startswith(';;'): |
| #include <assert.h> | |
| #include <stdarg.h> | |
| #include <stdbool.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <unistd.h> | |
| enum type { | |
| NIL, |
| 0xE22Cf9b8B08A1454191A2334a0225aC663359816 |
