{"id":2810,"date":"2025-06-07T14:28:17","date_gmt":"2025-06-07T14:28:17","guid":{"rendered":"https:\/\/diznr.com\/?p=2810"},"modified":"2025-06-07T14:28:17","modified_gmt":"2025-06-07T14:28:17","slug":"short-trick-to-find-the-given-grammar-is-ll1-or-not-in-compiler-design-hindi-in","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/short-trick-to-find-the-given-grammar-is-ll1-or-not-in-compiler-design-hindi-in\/","title":{"rendered":"Short trick to find the given grammar is (LL1) or not in Compiler Design In Hindi."},"content":{"rendered":"

Short trick to find the given grammar is (LL1) or not in Compiler Design In Hindi.<\/p>\n

[fvplayer id=”124″]<\/p>\n

LL(1) Grammar \u092a\u0939\u091a\u093e\u0928\u0928\u0947 \u0915\u0940 Short Trick | Compiler Design (in Hindi)<\/strong><\/h3>\n

LL(1) Grammar<\/strong> \u090f\u0915 Top-Down Parsing<\/strong> \u0924\u0915\u0928\u0940\u0915 \u0939\u0948, \u091c\u093f\u0938\u092e\u0947\u0902 Left-to-Right scanning<\/strong> \u0914\u0930 Leftmost derivation<\/strong> \u0915\u093e \u0909\u092a\u092f\u094b\u0917 \u0915\u093f\u092f\u093e \u091c\u093e\u0924\u093e \u0939\u0948, \u0914\u0930 \u0907\u0938\u092e\u0947\u0902 1 Lookahead symbol<\/strong> \u0939\u094b\u0924\u093e \u0939\u0948\u0964<\/p>\n

\u00a0Short Trick to Check LL(1) Grammar<\/strong><\/h3>\n

\u0915\u093f\u0938\u0940 \u092d\u0940 \u0926\u093f\u090f \u0917\u090f Grammar<\/strong> \u0915\u094b LL(1) Grammar<\/strong> \u0939\u0948 \u092f\u093e \u0928\u0939\u0940\u0902, \u092f\u0939 \u091a\u0947\u0915 \u0915\u0930\u0928\u0947 \u0915\u0947 \u0932\u093f\u090f \u0926\u094b \u092e\u0941\u0916\u094d\u092f Conditions<\/strong> \u0939\u094b\u0924\u0940 \u0939\u0948\u0902:<\/p>\n

Step 1: First & First Condition (No Common Terminals in First Sets)<\/strong><\/h4>\n

\u0939\u0930 Non-Terminal \u0915\u0947 \u0932\u093f\u090f FIRST \u0938\u0947\u091f \u0906\u092a\u0938 \u092e\u0947\u0902 Disjoint (\u0905\u0932\u0917-\u0905\u0932\u0917) \u0939\u094b\u0928\u0947 \u091a\u093e\u0939\u093f\u090f\u0964<\/strong>
\u00a0\u0905\u0917\u0930 \u0915\u093f\u0938\u0940 \u090f\u0915 \u0939\u0940 Non-Terminal \u0915\u0940 \u0926\u094b Productions \u092e\u0947\u0902 Common Terminal \u0906\u0924\u093e \u0939\u0948<\/strong>, \u0924\u094b Grammar LL(1) \u0928\u0939\u0940\u0902 \u0939\u094b\u0917\u0940<\/strong>\u0964<\/p>\n

Example (NOT LL(1)):<\/strong><\/p>\n

\n
S<\/span> \u2192 aA<\/span> | aB<\/span>
\nA<\/span> \u2192 x<\/span>
\nB<\/span> \u2192 y<\/span>
\n<\/code><\/div>\n<\/div>\n

FIRST(S)<\/strong> = {a, a}\u00a0 (Common Terminal ‘a’ \u0939\u0948<\/strong>) \u2192 Not LL(1)<\/strong><\/p>\n

Step 2: First & Follow Condition (No Conflict in Parsing Table)<\/strong><\/h4>\n

\u00a0\u0905\u0917\u0930 A \u2192 \u03b1 | \u03b2<\/strong> \u0914\u0930 FIRST(\u03b1) \u2229 FIRST(\u03b2) \u2260 \u2205 (Common Elements)<\/strong> \u0939\u0948\u0902, \u0924\u094b Grammar LL(1) \u0928\u0939\u0940\u0902 \u0939\u094b\u0917\u0940<\/strong>\u0964
\u0905\u0917\u0930 \u03b5 (epsilon) FIRST \u092e\u0947\u0902 \u0939\u0948<\/strong>, \u0924\u094b FIRST(\u03b1) \u2229 FOLLOW(A) = \u2205<\/strong> \u0939\u094b\u0928\u093e \u091a\u093e\u0939\u093f\u090f\u0964<\/p>\n

Example (LL(1)):<\/strong><\/p>\n

\n
S<\/span> \u2192 aA<\/span> | b<\/span>
\nA<\/span> \u2192 c<\/span> | \u03b5
\n<\/code><\/div>\n<\/div>\n

FIRST(A) = {c, \u03b5}<\/strong> \u0914\u0930 FOLLOW(A) = {b}<\/strong>
FIRST(A) \u0914\u0930 FOLLOW(A) \u092e\u0947\u0902 \u0915\u094b\u0908 Common Element \u0928\u0939\u0940\u0902 \u0939\u0948<\/strong> \u2192 LL(1) Grammar \u0939\u0948\u0964<\/strong><\/p>\n

\u00a0Quick LL(1) Checking Shortcut<\/strong><\/h3>\n

Step 1:<\/strong> FIRST \u0938\u0947\u091f \u092e\u0947\u0902 Common Terminals \u0928\u0939\u0940\u0902 \u0939\u094b\u0928\u0947 \u091a\u093e\u0939\u093f\u090f\u0964
Step 2:<\/strong> \u0905\u0917\u0930 \u03b5 (epsilon) \u0939\u0948<\/strong>, \u0924\u094b FIRST \u0914\u0930 FOLLOW \u0915\u093e Intersection Empty \u0939\u094b\u0928\u093e \u091a\u093e\u0939\u093f\u090f\u0964<\/strong>
Step 3:<\/strong> \u0905\u0917\u0930 \u0915\u094b\u0908 \u092d\u0940 Rule \u0907\u0928 Conditions \u0915\u094b \u0924\u094b\u0921\u093c\u0924\u093e \u0939\u0948 \u2192 Grammar LL(1) \u0928\u0939\u0940\u0902 \u0939\u0948\u0964<\/strong><\/p>\n

\u00a0Final Summary (One-Liner Trick)<\/strong><\/h3>\n

\u0905\u0917\u0930 \u0915\u093f\u0938\u0940 \u092d\u0940 Non-Terminal \u0915\u0940 FIRST Sets Overlap \u0928\u0939\u0940\u0902 \u0915\u0930\u0924\u0940 \u0914\u0930 \u03b5 \u0939\u094b\u0928\u0947 \u092a\u0930 FOLLOW \u0938\u0947 Confusion \u0928\u0939\u0940\u0902 \u0939\u094b\u0924\u093e, \u0924\u094b Grammar LL(1) \u0939\u094b\u0917\u0940!<\/strong><\/p>\n

\u0905\u0917\u0930 \u0906\u092a\u0915\u094b \u0915\u094b\u0908 \u0914\u0930 Example \u091a\u093e\u0939\u093f\u090f \u0924\u094b \u092a\u0942\u091b \u0938\u0915\u0924\u0947 \u0939\u0948\u0902!<\/p>\n

Short trick to find the given grammar is (LL1) or not in Compiler Design In Hindi.<\/a><\/h3>\n

ACADEMIC REGULATIONS COURSE STRUCTURE AND …<\/a><\/h3>\n

An Autonomous Institution<\/a><\/h3>\n

Here is a short trick<\/strong> to determine whether a given grammar is LL(1)<\/strong> or not, explained in Hindi<\/strong> for easy understanding. This will help especially in Compiler Design<\/strong> problems.<\/p>\n

\n

\ud83d\udcd8 LL(1) Grammar \u0915\u0948\u0938\u0947 \u091a\u0947\u0915 \u0915\u0930\u0947\u0902 \u2013 Short Trick (In Hindi)<\/h2>\n

\u2705 LL(1) Grammar \u0915\u093e \u092e\u0924\u0932\u092c:<\/strong><\/h3>\n

LL(1) grammar \u0935\u094b grammar \u0939\u094b\u0924\u093e \u0939\u0948 \u091c\u093f\u0938\u0947 Left to right<\/strong> \u092a\u0922\u093c\u0915\u0930 \u0914\u0930 Leftmost derivation<\/strong> \u0915\u0930\u0924\u0947 \u0939\u0941\u090f \u0938\u093f\u0930\u094d\u092b 1 lookahead symbol<\/strong> \u0938\u0947 parse \u0915\u093f\u092f\u093e \u091c\u093e \u0938\u0915\u0924\u093e \u0939\u0948\u0964<\/p>\n

\n

\ud83e\udde0 Short Trick: LL(1) Grammar \u091a\u0947\u0915 \u0915\u0930\u0928\u0947 \u0915\u0940 Steps<\/strong><\/h3>\n

\ud83d\udd39 Step 1: Left Recursion \u0928 \u0939\u094b<\/h4>\n

\u0905\u0917\u0930 grammar left recursive<\/strong> \u0939\u0948 (\u091c\u0948\u0938\u0947 A \u2192 A\u03b1 | \u03b2<\/code>), \u0924\u094b \u0935\u094b LL(1) \u0928\u0939\u0940\u0902 \u0939\u094b \u0938\u0915\u0924\u0940\u0964<\/p>\n

Trick:<\/strong>
\u0905\u0917\u0930 \u0915\u093f\u0938\u0940 production \u0915\u0940 right side \u0909\u0938\u0940 non-terminal \u0938\u0947 \u0936\u0941\u0930\u0942 \u0939\u094b\u0924\u0940 \u0939\u0948 \u2013 \u0924\u094b \u0935\u094b left recursive \u0939\u0948\u0964<\/p>\n

Example:<\/strong><\/p>\n

\n
less<\/div>\n
\n
\n