14. LL Parsing

preview_player
Показать описание
This time, we take a look a the LL parsing algorithm for (some) Context-Free Grammars.

  1. Nicolas “Norswap” Laurent
Рекомендации по теме
14. LL Parsing 0:16:06

14. LL Parsing

14 LL(1) Parser 0:05:43

14 LL(1) Parser Introduction

LL(1) Parsing Table 0:07:29

LL(1) Parsing Table

Compiler Design: Predictive 0:25:27

Compiler Design: Predictive Parsing-LL(1)

LL(1) Parsing 0:11:35

LL(1) Parsing

Compiler Lecture 14: 0:17:21

Compiler Lecture 14: LL Parsing (in Korean)

LL(1) parser | 0:15:46

LL(1) parser | First & Follow functions | Compiler Design | Lec-14 | by Bhanu Priya

Compiler Design Bangla 0:10:10

Compiler Design Bangla Tutorial 21 : Construction of LL(1) Parsing table

LL1 parser | 0:17:23

LL1 parser | Example-1 | Compiler Design | Lec-15 | Bhanu Priya

Introduction to Parsers 0:14:12

Introduction to Parsers

LL(1) Parsing – 0:19:47

LL(1) Parsing – Solved Problems (Set 1)

Compilers Lecture 14: 0:50:12

Compilers Lecture 14: Parsing (3): LL(1) Parsing, Part I

LL(1) Parsing Table 0:13:15

LL(1) Parsing Table in Compiler Design | Lecture 19

Lec-8: LL(1) Parsing 0:10:57

Lec-8: LL(1) Parsing Table | Check Whether a Grammar is LL(1) or Not

Construction Of LL(1) 0:04:59

Construction Of LL(1) Parsing Table In Compiler Design

LL(1) parser|predictive parser|non 1:27:26

LL(1) parser|predictive parser|non recursive predictive parsing

LL(1) Grammar: used 0:06:24

LL(1) Grammar: used in Predictive parsing

Lec-7: What is 0:09:38

Lec-7: What is Parsing & Types of Parsers | Syntax Analysis

Predictive Parser / 0:44:30

Predictive Parser / LL(1) Parser / Top-Down Parser

LL1 parser | 0:18:23

LL1 parser | Example-2 | Compiler Design | Lec-16 | Bhanu Priya

First and Follow 0:47:35

First and Follow Functions| LL(1) Parser | Construction Of Predictive parsing table | Parsing String

Functional Parsing - 0:22:46

Functional Parsing - Computerphile

Lec-10: What is 0:09:27

Lec-10: What is LL(1) Parser | How it Works | Full Concept

14. LR Parser 0:07:25

14. LR Parser in Compiler Design in English FULL EXPLANATION | LR parsing | Bottom up parsing

Комментарии
Автор

I want to thank you for you taking time to answer my questions. Its been decades since I did a compiler class. I managed to use your course up this point to create an expression parser grammar by hand that I checked against Gammophone to be LL(1). I used left-factoring and Head | Tail recursion.

However, my grammar only works if integers and floats have been tokenized. I'm reasonably sure LL cannot work if digits are tokens. So now I have to decide to use PEG with digit tokens or write a smarter tokenizer. I'm leaning towards the latter.

jasperschellingerhout
Автор

You kind of briefly glossed over it, but the fact that language theory looks at the rules to **generate** text, while parsers look at the text to **interpret** it into something useful (i.e. the AST) has always irritated me immensely. It makes it much harder to intuitively apply the theory to usable logic. It would have been nice if the theory had been modified for computer science to fit practical computing.
In other words, being able to produce (derive) text from a grammar is absolutely useless.

ErikBongers