# BNF

Published articles for BNF.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## A Practical guide to building a parser in Go

DevFeed: [A Practical guide to building a parser in Go](<https://devfeed.tech/articles/a-practical-guide-to-building-a-parser-in-go-27739.md>)

Original publisher: [Read original article](<https://gagor.pro/2026/01/a-practical-guide-to-building-a-parser-in-go/>)

Author: Tom

Published: 2026-01-04T00:00:00Z

Content type: tutorial

Language: en

Sources: [Tomasz Gągor](<https://devfeed.tech/sources/tomasz-gagor.md>)

Topics: [Go Language](<https://devfeed.tech/topics/go-language.md>), [Parser](<https://devfeed.tech/topics/parser.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Programming language](<https://devfeed.tech/topics/programming-language.md>)

Tags: [bnf](<https://devfeed.tech/tags/bnf.md>), [compilers](<https://devfeed.tech/tags/compilers.md>), [dsl](<https://devfeed.tech/tags/dsl.md>), [go](<https://devfeed.tech/tags/go.md>), [guide](<https://devfeed.tech/tags/guide.md>), [left-recursion](<https://devfeed.tech/tags/left-recursion.md>), [lexer](<https://devfeed.tech/tags/lexer.md>), [packrat-memoization](<https://devfeed.tech/tags/packrat-memoization.md>), [parsing](<https://devfeed.tech/tags/parsing.md>), [programming](<https://devfeed.tech/tags/programming.md>), [recursive-descent-parser](<https://devfeed.tech/tags/recursive-descent-parser.md>)

### AI overview

A developer describes building a recursive descent parser in Go to validate strings against a BNF-like grammar. The project began as an attempt to implement a simple BNF syntax analyzer and led to exploring parser and compiler concepts, including left recursion and Packrat memoization.

### Source excerpt

A developer's journey of building a recursive descent parser in Go, from basic concepts to tackling left recursion with Packrat memoization.

## Let's Build A Simple Interpreter. Part 4.

DevFeed: [Let's Build A Simple Interpreter. Part 4.](<https://devfeed.tech/articles/let-s-build-a-simple-interpreter-part-4-33325.md>)

Original publisher: [Read original article](<https://ruslanspivak.com/lsbasi-part4/>)

Author: Ruslan Spivak

Published: 2015-09-11T11:00:00Z

Content type: tutorial

Language: en

Sources: [Ruslan Spivak](<https://devfeed.tech/sources/ruslan-spivak.md>)

Topics: [Parser](<https://devfeed.tech/topics/parser.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Parsing](<https://devfeed.tech/topics/parsing.md>), [syntax](<https://devfeed.tech/topics/syntax.md>), [generators](<https://devfeed.tech/topics/generators.md>)

Tags: [blog](<https://devfeed.tech/tags/blog.md>), [bnf](<https://devfeed.tech/tags/bnf.md>), [code](<https://devfeed.tech/tags/code.md>), [generators](<https://devfeed.tech/tags/generators.md>), [programming](<https://devfeed.tech/tags/programming.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

Part 4 of a series on building a simple interpreter. It explains how to parse and interpret arithmetic expressions containing multiplication and division, including integer division, and introduces context-free grammars and modified EBNF notation for specifying programming-language syntax.

### Source excerpt

Have you been passively learning the material in these articles or have you been actively practicing it? I hope you've been actively practicing it. I really do :) Remember what Confucius said? "I hear and I forget." "I see and I remember." "I do and I understand." In the previous ...