Trent + Chippi = TRIPPI Programming Language (Project for CS451)
-
Updated
Mar 28, 2017 - Go
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.
Trent + Chippi = TRIPPI Programming Language (Project for CS451)
Vietnamese tokenizer (Maximum Matching and CRF)
A simple brainf**k interpreter made in rust.
📄 | Recursive descent parser | Abstract Syntax Trees | Tokenizer
Neural Networks: zero to hero
simple implementation of LLM Tokenizer
Train a model using LSTM(Long short-term memory) to classify whether hotel reviews are positive or negative
NatA Lang is an educational language and compiler built in C to explore reader, scanner, and parser stages using formal models like REs and BNF.
🐚 A fully functional mini shell written in C as part of the 42 school curriculum. Implements key shell features like built-in commands, pipelines, redirections (<, >, >>, <<), and environment variable expansion. Designed to mimic basic Bash behavior while exploring process creation, parsing, file descriptors, and terminal signal handling.
🀄 The Jieba Chinese Analyzer for INFINI Pizza.
Coronavirus tweets NLP - Text Classification mini-project work for Data Science course, FCSE, Skopje
Modelo de machine learning para clasificar reseñas de películas como positivas o negativas, usando el dataset IMDB de más de 47,000 reseñas, con evaluación basada en la métrica F1.
A clean, educational implementation of the Byte Pair Encoding algorithm used in modern language models like GPT.
A simple to use, leak free tokenization replacement for strtok and strsep
Lexer classes for cl-stream
The implementation of MaxMatch algorithm in golang
Solutions to the 8-10 projects in Haxe language