Learning how programming languages work is valuable for all developers, enabling the creation of custom linting rules, IDE extensions, and domain-specific languages (DSLs).
Programming languages are defined by grammars, which are sets of rules that distinguish between regular grammars (predictable, sequential) and context-free grammars (recursive, complex).
Languages are not inherently interpreted or compiled; their implementations are, with some systems like V8 using both a compiler and an interpreter.
Code is processed through a pipeline that includes scanning (lexing), parsing into an abstract syntax tree (AST), analysis, and finally evaluation by an interpreter or compiler.
A live demonstration shows how to use typescript-parsec to build a lexer that creates a stream of tokens and a parser that organizes them into an abstract syntax tree (AST).
The interpreter is built as a recursive function that walks the abstract syntax tree (AST), evaluating each node to produce a final result while managing variable scope.
A new print feature using a question mark suffix is added by updating the lexer to recognize the token, the parser to create a new AST node, and the interpreter to handle the new logic.
The talk concludes by sharing the open-source project and providing resources for anyone interested in exploring programming language creation further.
27:27Stefan Schöberl
27:25Irina Artemeva
45:59Miro Spönemann
31:39Rainer Stropek
41:21Florian Rappl
30:36Clemens Helm
27:18Milan Todorović
25:29Diana Gastrin
Jobs that call for the skills explored in this talk.
Speech Processing Solutions
Vienna, Austria
doinstruct Software GmbH
Berlin, Germany
CONTIAMO GMBH
Berlin, Germany
autoiXpert GmbH & Co. KG
Stuttgart, Germany
