{"id":6519,"date":"2026-01-06T12:33:12","date_gmt":"2026-01-06T07:03:12","guid":{"rendered":"https:\/\/study.madeeasy.in\/?p=6519"},"modified":"2026-01-06T12:33:12","modified_gmt":"2026-01-06T07:03:12","slug":"parsing","status":"publish","type":"post","link":"https:\/\/www.madeeasy.in\/study\/cs-it\/parsing","title":{"rendered":"Parsing"},"content":{"rendered":"<p style=\"text-align: justify;\">LL(1) Parsing means that the grammar allows a deterministic parser that operates from left to right, produces leftmost derivation, using a look ahead of one symbol. To make the parsing deterministic, we could require that each parse table entry contain at most one element. In terms of grammar, this means that all right-hand sides of a non-terminal start with different terminal symbol. A grammar that fulfills this requirement is called a simple LL(1) grammar (SLL(1)), or an s-grammar. Deterministic parsers are much faster than non-deterministic parser.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-6520 size-full\" src=\"https:\/\/study.madeeasy.in\/wp-content\/uploads\/2026\/01\/parsing.jpg\" alt=\"Parsing\" width=\"520\" height=\"225\" srcset=\"https:\/\/www.madeeasy.in\/study\/wp-content\/uploads\/2026\/01\/parsing.jpg 520w, https:\/\/www.madeeasy.in\/study\/wp-content\/uploads\/2026\/01\/parsing-300x130.jpg 300w\" sizes=\"auto, (max-width: 520px) 100vw, 520px\" \/><\/p>\n<p><strong>Algorithm: FIRST Set Computation<\/strong><\/p>\n<p>The construction of LL(1) parser is aided by two functions associated with a grammar G. These functions,<br \/>\nFirst and Follow allow us to fill in the entries of a predictive parsing table for G, whenever possible.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6521 size-full\" src=\"https:\/\/study.madeeasy.in\/wp-content\/uploads\/2026\/01\/grammar-symbols.jpg\" alt=\"Grammar Symbols\" width=\"948\" height=\"817\" srcset=\"https:\/\/www.madeeasy.in\/study\/wp-content\/uploads\/2026\/01\/grammar-symbols.jpg 948w, https:\/\/www.madeeasy.in\/study\/wp-content\/uploads\/2026\/01\/grammar-symbols-300x259.jpg 300w, https:\/\/www.madeeasy.in\/study\/wp-content\/uploads\/2026\/01\/grammar-symbols-768x662.jpg 768w\" sizes=\"auto, (max-width: 948px) 100vw, 948px\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>LL(1) Parsing means that the grammar allows a deterministic parser that operates from left to right, produces leftmost derivation, using<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1908,3],"tags":[1927,1926],"class_list":["post-6519","post","type-post","status-publish","format-standard","hentry","category-compiler","category-cs-it","tag-grammar-symbols","tag-parsing"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6519","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=6519"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6519\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=6519"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=6519"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=6519"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}