Just revising on the previous part we have the following relation. Here $Lang$ denote the set of languages defined by the given set of grammars. $LL(0) \subset LL(1) \subset LL(2) \dots LL(k) \subset LL(k+1)\dots$ $Lang(LL(0)) \subset Lang(LL(1)) \subset Lang(LL(2)) \dots Lang(LL(k)) \subset Lang(LL(k+1))\dots$ $LR(0) \subset LR(1) \subset LR(2) \dots LR(k) \subset LR(k+1)\dots$ $Lang(LR(0)) \subset Lang(LR(1)) […]

## LR Parsing Part 2: Language of LL and LR grammars

Language of parsers

## Viable Prefixes and Handle in LR Parsing

Bottom up Parsing, Viable Prefix, Handle

## Demystifying Database Normalization

Database Normalization, First Normal form to BCNF summerized with examples

## 2018 Year Placement Statistics for CSE

Placement Statistics for Year 2018 for Computer Science & Engineering