Update app.py

app.py

@@ -1,5 +1,6 @@
 import streamlit as st
 
+# Initial setup for grammar input
 rules = []
 nonterm_userdef = []
 term_userdef = []
@@ -8,6 +9,7 @@ firsts = {}
 follows = {}
 start_symbol = None
 
+# Function to remove left recursion
 def removeLeftRecursion(rulesDiction):
     store = {}
     for lhs in rulesDiction:
@@ -34,6 +36,7 @@ def removeLeftRecursion(rulesDiction):
         rulesDiction[left] = store[left]
     return rulesDiction
 
+# Function to perform left factoring
 def LeftFactoring(rulesDiction):
     newDict = {}
     for lhs in rulesDiction:
@@ -64,6 +67,7 @@ def LeftFactoring(rulesDiction):
             newDict[key] = tempo_dict[key]
     return newDict
 
+# Function to calculate FIRST set
 def first(rule):
     if len(rule) != 0 and rule[0] in term_userdef:
         return rule[0]
@@ -93,6 +97,7 @@ def first(rule):
             fres.append('#')
             return fres
 
+# Function to calculate FOLLOW set
 def follow(nt):
     solset = set()
     if nt == start_symbol:
@@ -122,6 +127,7 @@ def follow(nt):
                     solset.update(res if type(res) is list else [res])
     return list(solset)
 
+# Compute FIRST for all non-terminals
 def computeAllFirsts():
     global firsts
     for y in diction.keys():
@@ -131,11 +137,13 @@ def computeAllFirsts():
             if result is not None:
                 firsts[y].update(result if type(result) is list else [result])
 
+# Compute FOLLOW for all non-terminals
 def computeAllFollows():
     global follows
     for NT in diction.keys():
         follows[NT] = set(follow(NT))
 
+# Parse table creation function
 def createParseTable():
     global term_userdef, firsts, follows
     table = {}
@@ -158,6 +166,7 @@ def createParseTable():
                     grammar_is_LL = False
     return table, grammar_is_LL
 
+# Validate input string function
 def validateStringUsingStackBuffer(parse_table, input_string):
     stack = [start_symbol, '$']
     buffer = ['$'] + input_string.split()[::-1]
@@ -178,10 +187,9 @@ def validateStringUsingStackBuffer(parse_table, input_string):
                 return "Invalid String"
     return "Valid String"
 
-
+# Streamlit Interface
 st.title("LL(1) Grammar Analyzer")
 
-
 st.subheader("Grammar Rules Input")
 start_symbol = st.text_input("Enter Start Symbol (Non-terminal)")
 num_rules = st.number_input("Number of Grammar Rules", min_value=1, step=1)
@@ -191,11 +199,9 @@ for i in range(num_rules):
     if rule:
         rules.append(rule)
 
-
 nonterm_userdef = st.text_input("Enter Non-Terminals (comma-separated)").split(',')
 term_userdef = st.text_input("Enter Terminals (comma-separated)").split(',')
 
-
 if st.button("Analyze Grammar"):
     diction.clear()
     firsts.clear()