📄 | Recursive descent parser | Abstract Syntax Trees | Tokenizer
-
Updated
Dec 17, 2023 - JavaScript
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
📄 | Recursive descent parser | Abstract Syntax Trees | Tokenizer
Lightweight tokenizer and syntax highlighter
A platform-agnostic Mash creation algorithm
Tokenizes Chinese texts into words.
fast, native syntax highlighting [wip]
Visualiza cómo los modelos de IA procesan y tokenizan tu texto
Ultra-fast, client-side token counter for large text blobs
javascript wordcloud generator supporting persian language using server + client
A simple tokenizer visualizer for processing text data into tokens to illustrate tokenization process in AI models for education purpose.
A JavaScript implementation of a Thai syllable segmenter using Conditional Random Fields (CRF). This tool segments Thai text into syllables, which is crucial for many NLP tasks in Thai language processing including text-to-speech, phonetic analysis, and language learning applications.
Yet another powerful tokenizer in js.
Chinese tokenizer base on nodejieba and pullword
A jQuery tool to tokenizer value on input
The client connects to a frontend server using a middleware load balancer that manages Docker instances with a "least connected" algorithm. New instances register dynamically, and a monitoring endpoint shows logs and request counts. The service counts tokens in text.