Constructing a Lexer: First Symbols

Related lectures (31)

Page 3 of 4

Covers error correction using Shor codes and their concatenation to improve capabilities.

Introduces the basics of automata theory and explores the theorems of regular languages.

Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.

Covers the Shor Code, stabilizer matrices, encoding techniques, and error correction concepts.

Covers computer language processing, compilers, skills learned, and application examples.

Covers the implementation of Conc-Trees in Scala for parallel programming.

Covers object-oriented parser combinators in Scala for building parsers, including JSON parsing and testing.

Covers the basics of working with strings in Java, including syntax, char type, operators, and concatenation.

Explores the conversion of regular expressions to automata for efficient character classification.

Explores digital urban history, Python basics, geocoding, interactive maps, shapefiles, and data conversion.