📚 Formal grammars are the focus of this session.
💡 The syntax analysis phase of a compiler uses a specific grammar for a given arithmetic expression.
🔄 If the parse tree's yield matches the expression's syntax, there are no syntax errors.
📚 Formal Grammars are used to describe the structure of sentences in a language.
🔤 A grammatically correct English sentence follows the order of noun, verb, and adjective.
🔄 Replacing the nouns, verbs, and adjectives in a sentence can result in another grammatically correct sentence.
✅ Formal grammars consist of variables and terminals.
🔄 Variables allow for different options, while terminals fix the choices.
⚙️ The process of selecting variables and fixing terminals is called generation.
✨ Formal grammars consist of terminals (constants) and non-terminals (variables).
🔡 Non-terminals provide options for the generation process.
⚙️ The generation process follows a specific structure of noun followed by verb phrase.
📚 A formal grammar is defined using four tuples n t p and s.
🔡 n denotes a collection of non-terminals and t denotes a collection of terminals.
🧮 p represents a set of rules that help in the production of sentences.
📚 Formal grammars are specified using sets of non-terminals and terminals.
🌟 The start symbol initiates the process of derivation.
💡 Production rules are used to generate strings in a formal grammar.
✨ Formal grammars are defined by four tuples: n, t, p, and s.
📚 The production rules (p) are the most important part of grammar and language specification.
🎓 The next session will focus on the classification of formal grammars.