Skip to content
#

lexical-analysis

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.

Here are 608 public repositories matching this topic...

An OCaml-based lexical analyzer that identifies and classifies tokens such as identifiers, operators, punctuation symbols, integer literals, and keywords. The project involves tokenizing input text, categorizing tokens, and printing them with their respective categories. Key functions include tokenize, is_alnum, is_punctuation, and print_tokens.

  • Updated Jun 1, 2024
  • OCaml

Sure, here's a concise description for your repository: This repository contains programs from the Compiler Design Lab, covering lexical analysis, parsing, syntax tree generation, and more. Implemented in C, C++, Java, and Lex, these programs demonstrate essential compiler design concepts and techniques.

  • Updated May 19, 2024
  • C

INTERSPEECH 2023 Papers: A complete collection of influential and exciting research papers from the INTERSPEECH 2023 conference. Explore the latest advances in speech and language processing. Code included. Star the repository to support the advancement of speech technology!

  • Updated May 18, 2024