Parser

100%

✓ Published0🌍 Public

Last edited Aug 12, 2017

Created on Aug 12, 2017

This example presents a recursive descent parser for a simple grammar of arithmetic-like expressions using the operators "+" and "/" to represent horizontal and vertical composition. The code defines a tokenizer and parsing functions for factors, terms, and expressions, building a nested tree structure with orientation and children properties. It includes a comprehensive test suite that verifies parsing results for various input strings, including precedence, parentheses, and multi-character names. The parser runs entirely in the browser console, using no external libraries.

AI-generated description

Built with blockbuilder.org

mit Licensed

Similar vizzes

Loading thumbnail…

grammar pseudo language

This visualization shows the grammar rules of a custom programming pseudo-language as defined in a Jison specification file. It uses Jison’s `%lex` and `%ebnf` sections to declare lexical tokens (e.g., `NUMBER`, `PRINTLN`) and a grammar for mathematical expressions, functions, assignments, and print statements. The example includes semantic actions in JavaScript that return computed values or generated code strings, and a custom `parser.main` function tests two sample inputs by calling `parser.parse()`. The source is a GitHub gist by GerHobbelt.

GGerHobbelt

59% match

Loading thumbnail…

OP file, compilable by jison-gho. SO: https://stackoverflow.com/posts/58902159

This example demonstrates a Jison-gho lexer and parser grammar for a custom GIF-like code language, converting token sequences into an abstract syntax tree. The lexer uses state management (`begin`, `popState`, `delimit` and `string_literal` states) to enforce semicolon delimiters between tokens and handle quoted strings. The parser defines operator precedence with `%left` declarations and builds AST nodes via `new yy.Stmt` and `new yy.Expr` constructors, processing number literals, identifiers, and control flow keywords. The grammar handles numeric formats and string concatenation rules visible in rules like `UFloat` and `AlfanumAtom`.

GGerHobbelt

59% match

Loading thumbnail…

Lexing and Parsing in JavaScript

This example demonstrates a live lexer and recursive descent parser for a custom wiki-like markup language, converting user input from a textarea into HTML output. The code uses d3.v2 to manage DOM selection and event handling, registering callbacks that recompile the input on changes. It showcases the parsing pipeline by processing the typed text in real time, with a table tracking events fired on the html, body, and textarea elements. The parser applies grammar rules in precedence order, prioritizing robustness over performance by assuming limited input size.

GGerHobbelt

57% match

Loading thumbnail…

Function

This example demonstrates a set of JavaScript functions for basic arithmetic and variable assignment, with results logged to the browser console. It shows how arrow functions like `add` and `sub` compute sums and differences, while the `copy` and `dup` functions illustrate function aliasing. The code uses plain JavaScript without any external libraries or frameworks, embedded directly in an HTML page with a large 13em body text style. The rendering approach is entirely console-based, with no visual data output.

NNita

55% match

Loading thumbnail…

requirebin sketch

This example demonstrates a tokenizer in action, parsing a string of mathematical and symbolic notation to identify and categorize each token as a string, bracket, symbol, or whitespace. The visualization shows the parsed output in the console as the tokenizer processes the input. The code uses the `tokenizer` library, adding rules with regular expressions to define token types, and ignores whitespace during parsing. The source data is a hardcoded string containing mixed symbols and numbers, rendered through the console log output.

HHypercubed

53% match

Loading thumbnail…

Untitled

This example demonstrates JavaScript boolean operators by evaluating and displaying the results of `(a && b)` and `(a || b)` directly in the browser. It uses the `document.write()` method to output the operand values and their combined results, with each result separated by an HTML line break. The page relies on plain JavaScript embedded in an HTML body, with no external libraries or frameworks, showcasing a minimal approach to testing logical expressions in a static web page.

Iikbb-kbj

52% match

Loading thumbnail…

Basic Calculator Practice JS

This example shows a minimal web-based calculator that performs addition, subtraction, division, and multiplication on two fixed numbers (8 and 2). The interface displays those operands alongside four operation buttons and a result area. JavaScript event handlers assigned via inline `onclick` attributes in the HTML call the corresponding functions, which directly update the text content of the `sum-el` element. The demo relies on raw DOM manipulation through `document.getElementById` and `textContent`, with styling provided by plain CSS.

GGayan Priyadarshana

52% match

Loading thumbnail…

Gist 0ae5e1a27ffc3cfab328c1895ac272cf

This example visualizes the structure of a DAX query plan by parsing its text into a hierarchical tree. It uses the `moo` lexer to tokenize the query plan, recognizing operators, column references, measure references, and property assignments. The parser builds a nested tree from indentation and line breaks, while a custom `parseProperties` function extracts key-value pairs from tokens, including hash-prefixed attributes and parenthesized groups. The visualization reveals the query plan’s operator flow and parameter details, though the rendering itself is not implemented in the shown code.

HHugoberry

52% match