This document contains slides from a lecture on parser implementation. It introduces BNF and EBNF notation for context-free grammars and shows example grammars for expressions. It then outlines the steps to implement a parser according to a given grammar using a recursive descent approach. Code snippets are provided for various parser rules corresponding to the grammar rules. The slides conclude by assigning homework to modify the provided source code to implement additional grammar rules for a programming language.