In this slide you will explore more about how to make derivations ,design parse tree ,what is ambiguity and how to remove ambiguity ,left recursion ,left factoring .
In this slide you will explore more about how to make derivations ,design parse tree ,what is ambiguity and how to remove ambiguity ,left recursion ,left factoring .
This slide is prepared By these following Students of Dept. of CSE JnU, Dhaka. Thanks To: Nusrat Jahan, Arifatun Nesa, Fatema Akter, Maleka Khatun, Tamanna Tabassum.
This Presentation is used to create PPT on the topic "Chomsky Normal Form" in Theory of Computation. This presentation is also useful to study this topic.
This lecture covers:
1. Regular Language and Regular Operations
2. Closure properties of DFAs
3. Union of 2 DFA machines
4. Intersection of 2 DFA machines
5. Complement of DFA machines
Theory of competition topic simplification of cfg, normal form of FG.pptxJisock
Table of Contents (TOC) is a list of the headings or sections in a document, typically found at the beginning of the document. The TOC provides a quick reference for the reader to navigate to the specific section they are interested in reading.
In terms of grammar, TOCs often use parallel structure to list the headings and subheadings, such as using bullet points or numbered lists. In addition, TOCs may also use capitalization, bold or italic formatting to indicate the level of the heading or subheading.
A typical TOC structure is to start with the main heading, followed by subheadings and sub-subheadings. For example, the main heading may be "Introduction," followed by subheadings "Background," "Purpose," and "Methodology." Each subheading may then have sub-subheadings, such as "Background" having sub-subheadings "Historical context" and "Recent developments."
It's important to note that TOCs can vary depending on the type of document and the style guide being used. Some TOCs may use numbers, while others use bullet points. Additionally, some TOCs may include page numbers while others may not.
In summary, TOCs provide a quick reference for the reader to navigate the document, often using parallel structure, capitalization, and formatting to indicate the level of headings and subheadings. The structure and formatting of TOCs may vary depending on the type of document and style guide being used.
This slide is prepared By these following Students of Dept. of CSE JnU, Dhaka. Thanks To: Nusrat Jahan, Arifatun Nesa, Fatema Akter, Maleka Khatun, Tamanna Tabassum.
This Presentation is used to create PPT on the topic "Chomsky Normal Form" in Theory of Computation. This presentation is also useful to study this topic.
This lecture covers:
1. Regular Language and Regular Operations
2. Closure properties of DFAs
3. Union of 2 DFA machines
4. Intersection of 2 DFA machines
5. Complement of DFA machines
Theory of competition topic simplification of cfg, normal form of FG.pptxJisock
Table of Contents (TOC) is a list of the headings or sections in a document, typically found at the beginning of the document. The TOC provides a quick reference for the reader to navigate to the specific section they are interested in reading.
In terms of grammar, TOCs often use parallel structure to list the headings and subheadings, such as using bullet points or numbered lists. In addition, TOCs may also use capitalization, bold or italic formatting to indicate the level of the heading or subheading.
A typical TOC structure is to start with the main heading, followed by subheadings and sub-subheadings. For example, the main heading may be "Introduction," followed by subheadings "Background," "Purpose," and "Methodology." Each subheading may then have sub-subheadings, such as "Background" having sub-subheadings "Historical context" and "Recent developments."
It's important to note that TOCs can vary depending on the type of document and the style guide being used. Some TOCs may use numbers, while others use bullet points. Additionally, some TOCs may include page numbers while others may not.
In summary, TOCs provide a quick reference for the reader to navigate the document, often using parallel structure, capitalization, and formatting to indicate the level of headings and subheadings. The structure and formatting of TOCs may vary depending on the type of document and style guide being used.
Automata theory - describes to derives string from Context free grammar - derivation and parse tree
normal forms - Chomsky normal form and Griebah normal form
Table of Contents (TOC) is a list of the headings or sections in a document, typically found at the beginning of the document. The TOC provides a quick reference for the reader to navigate to the specific section they are interested in reading.
In terms of grammar, TOCs often use parallel structure to list the headings and subheadings, such as using bullet points or numbered lists. In addition, TOCs may also use capitalization, bold or italic formatting to indicate the level of the heading or subheading.
A typical TOC structure is to start with the main heading, followed by subheadings and sub-subheadings. For example, the main heading may be "Introduction," followed by subheadings "Background," "Purpose," and "Methodology." Each subheading may then have sub-subheadings, such as "Background" having sub-subheadings "Historical context" and "Recent developments."
It's important to note that TOCs can vary depending on the type of document and the style guide being used. Some TOCs may use numbers, while others use bullet points. Additionally, some TOCs may include page numbers while others may not.
In summary, TOCs provide a quick reference for the reader to navigate the document, often using parallel structure, capitalization, and formatting to indicate the level of headings and subheadings. The structure and formatting of TOCs may vary depending on the type of document and style guide being used.
This is the presentation on Syntactic Analysis in NLP.It includes topics like Introduction to parsing, Basic parsing strategies, Top-down parsing, Bottom-up
parsing, Dynamic programming – CYK parser, Issues in basic parsing methods, Earley algorithm, Parsing
using Probabilistic Context Free Grammars.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
2. Prerequisite
1. At very first session we have seen that the Finite Automata and
importance of Finite State Machines and the construction of
Deterministic Finite Automata and some examples on it.
2. In previous session we have seen that the construction of Regular
Expressions for the given problems and how to generate a Regular
expression from the DFA and vice versa.
3. The above two concepts are required to understand the Context
Free Grammar and the applications of CFG.
3. DEFINITION
• The Context Free Grammar can be defined as a set denoted by G=(V,T,P,S)
Where
V- set of non-terminals Ex: { P,Q,R…}
T- set of Terminals Ex: {p,q,r …}
P- set of Production rules
Where non-terminal -> non-terminal
non-terminal -> terminal
S- is start symbol.
5. Example1 : Construct CFG which consists of all the strings having atleast one
occurrence of ‘000’ over input {0,1}.
• Solution:
We need to construct the equivalent R.E for the given problem
first.
The R.E=(any number of 0’s or 1’s) 000 (any number of 0’s or 1’s)
Thus R.E = (0+1)*000(0+1)*
Now let us build the production rules to satisfy the above R.E
{ S->ATA
A->0A|1A|Ꜫ
T->000 }
6. Excercise1: Find the CFG for the odd length of strings in{a,b}*
with middle symbol a
Excercise2: Generate the a CFG to obtain balanced set of
parenthesis(i.e. every left parenthesis should match with
corresponding right parenthesis)
7. Derivation Trees
• Definition: Derivation tree is a graphical representation for the
derivation of the given production rules for a given CFG.
• It is the simple way to show how the derivation can be done to obtain
some string from given set of production rules.
• The derivation tree is also called as Parse tree.
Properties of Derivation Tree:-
1. The root node is always a node indicating start symbol.
2. The derivation is read from left to right.
3. The leaf nodes are always terminal nodes.
4. The interior nodes are always the non-terminal nodes.
8. Example2: The CFG is given as S->bSb | a | b is a production rule. The S is
a start symbol.
• Solution :
The Derivation tree for deriving a string bbabb as follows.
S
b S b
b S b
a
By Simply reading the leaf nodes we can obtain the desired string.
9. Exercise : Construct the derivation tree for the string ‘aabbabba’ from
the CFG given by
S->aB|bA
A->a|aS|bAA
B->b|bS|aBB
10. Difference between Regular Grammar and Context Free Grammar
S.No. REGULAR GRAMMAR CONTEXT FREE GRAMMAR
1 Regular grammar is Defined as G=(V,T,P,S)
where V- set of Non-Terminals,
T- set of Terminals, P- set of Production rules, S-
start Symbol
Hence G be a regular Grammar.
The Context free grammar is defined as follows G=(V,T,P,S)
where V- set of Non-Terminals,
T- set of Terminals, P- set of Production rules, S- start Symbol
Hence G be a CFG.
2 Using this grammar we can draw DFA Using this we can construct Push Down Automata(PDA)
3 Compiler can not make use of this for Parsing. Compiler makes use of this for Parsing.
4 The grammar accepts small set of languages.
Hence it is type-3 grammar.
The grammar accepts a large set of languages. Hence it is
type-2 grammar.
5 This form of grammar can be represented by left
linear or right linear grammar
This form of grammar can be represented as nonterminal->
set of terminals and non terminals.
6 Every regular grammar is context free grammar. Every Context Free Grammar can not be Regular
7 For Ex: S->aA|B
A->aA|a
B->bB|b
For Example:
S->aSb|bSb|Ꜫ
8 Syntax of any programming language can not be
represented completely by regular grammar
Syntax of any programming language can be represented
completely by regular grammar
11. MINIMIZATION OF CFG
• The properties of reduced grammar are as follows.
1. Each variable(i.e. non terminal) and each terminal of G appears in the
derivation of some word in L.
2. There should not be any production as X->Y where X and Y are non
terminal.
3. If Ꜫ is not in the language L then there need not be the production X-> Ꜫ.
12. The Reduction of Grammar as follows
Removal of Useless
symbols
Elimination of
Ꜫ Productions
Removal of unit
production
13. Removal of useless symbols
• Any symbol is not useful when it appears on R.H.S. in the production rule. If no
such derivation exists then it is supposed to be a useless symbol.
For Example:
G= (V,T,P,S) where V={S,T,X} T={0,1}
S->0T|1T|X|0|1
T->00
In the above grammar S->X there is no further rule as a definition to X. Hence we
can declare X is a useless symbol. Therefore we can remove the S-> X production
from the given grammar.
After removal of useless symbol form the given grammar the Grammar should be
as follows.
G= (V,T,P,S) where V={S,T} T={0,1}
S->0T|1T|0|1
T->00
14. Excercise1: Eliminate the useless symbols from the following grammar
S->aS|A|C
A->a
B->aa
C->aCb
Exercise 2: Eliminate the useless symbols from the given grammar.
S->aA|a|Bb|cC
A->aB
B->a|Aa
C->cCD
D->ddd
15. Elimination of Ꜫ production
• In CFG if there is Ꜫ production we can remove it ,without changing the
meaning of the grammar.
Example:
S->0S|1S| Ꜫ
from the above Grammar we can remove Ꜫ production without
changing the meaning of it.
Simply if we place S-> Ꜫ in other rules.
we get S->0 and S->1 Hence we can rewrite the productions as
follows
S->0S|1S|0|1
Thus we can remove Ꜫ production from the given grammar
16. Example2: For the CFG given below remove Ꜫ production
S->aSa
S->bSb
S-> Ꜫ
• Solution:
According to the replacement procedure we will place Ꜫ at S in
the sentential form.
S->aSa if S= Ꜫ
S->aa
Similarly if
S->bSb if S= Ꜫ
S->bb
Thus finally rules are
S->aSa|bSb|aa|bb
Thus we can remove Ꜫ production from the given grammar.
17. Excercise1: Eliminate Ꜫ productions from the CFG given below
A->0B1|1B1
B->0B|1B|Ꜫ
Exercise 2: Construct the CFG without Ꜫ productions form the given
Grammar.
S->a|Ab|aBa
A->b|Ꜫ
B->b|A
18. Removal of Unit Productions
• The unit productions are the productions in which one non terminal
gives another non terminal.
For example X->Y, Y->Z, Z->X are the unit productions.
Example 1: if CFG is as below
S->0A|1B|C
A->0S|00
B->1|A
C->01 then remove the unit productions.
Solution:
Clearly S->C is a unit production. But while removing it we have
to consider what C gives. So, we add a rule to S.
S->0A|1B|01
19. Example 1(2):
• Similarly B->A is also unit production so we can modify it as
B->1|0S|00
Thus finally we can write CFG without unit productions as
S->0A|1B|01
A->0S|00
B->1|0S|00
C->01
20. Exercise: Eliminate the unit productions fro the Grammar
S->AB
A->a
B->C|b
C->D
D->E|bC
E->d|Ab
21. Next Class:
•We will discuss about the Push Down Automata.
•Conversion of CFG to PDA and some exercises.
•Construction of CFG from PDA some exercises.
23. Solution:
Back
a or b a or ba
Length n Length n
Thus the R.E = (a+b)n a (a+b)n Where n>=0
As the above given expression doesn’t represent regular language, The DFA can
not be designed for representing such language.
The CFG G= (V,T,P,S)
Where
V={S}
T={a,b}
P={ S->aSa|bSb|aSb|bSa|a}
S is Start Symbol.
24. Solution:
Back
The well formed parenthesis means whenever opening parentheses is
present there should be a closing parentheses associated with it.
Any expression must begin with opening bracket .We will consider
T={(,[,),]} as set of brackets.
The CFG G=(V,T,P,S)
Where V={S}
T={(,[,),]}
P={ S->SS|()|[]|(S)|[S]
Where S is Start Symbol.
25. Solution :
• To draw a tree we will first try to
obtain derivation for the string
aabbabba.
S
aB S->aB
a aBB B->aBB
aa bS B B->bS
aab bA B S->bA
aabba B A->a
aabba bS B->bS
aabbab bA S->bA
aabbabba A->a
• Now let us draw a tree
S
a B
a B B
b S b S
b A b A
a a
Back
26. Solution:
• We will first write all the productions that are giving terminal symbols.
A->a
B->aa
But if we look at start symbol S then
S->aS|A|C
There is no production for B from start symbol. Thus B become a useless
symbol.
Similarly, S->C->aCb->aaCbb->….
There is no terminating symbol for C, Therefore we will eliminate C.
Then the set of rules are
S->aS|A
A->a
Back
27. Solution:
• Consider all the productions that are giving terminal symbols
S->a
B->a
D->ddd
Now Consider
S->cC
C->cCD
D->ddd.
We will try to derive the string using production rule C we get ,
S->cC->ccCddd->cccCDddd->….
We will not get any terminal symbol for C. Thus we can eliminate C production . To reach D , Cis the only
production, As C is eliminated there is no point of D production. Hence , D is also eliminated.
Therefore,
S->aA|a|Bb
A->aB
B->a|Aa
Is the reduced Grammar.
Back
28. Solution:
• Now the Ꜫ production is B->Ꜫ we will delete this production, And then add
the production having B replaced by Ꜫ
A->0B1 if B=Ꜫ
A->01
Similarly, A->1B1->11
A->0B1|1B1|01|11
Similarly,
B->0B->0
B->1B->1
B->0B|1B |0|1
Collectively we can write
A->0B1|1B1|01|11
B->0B|1B|0|1
Back
29. Solution:
• As S->AB and A->a
There is only one rule with A which is giving terminal symbol. Hence there is no Unit production with A.
Now Consider,
B->C
C->D
D->E
It is clear that B,C and D are Unit Productions. As E->d|Ab, we will replace value of D. Then
D->d|Ab|bC
Similarly, a C->D we can write
C->d|Ab|bC
Hence B->d|Ab|bC|b
Thus the grammar after removing unit productions
S->AB
A->a
B->d|Ab|bC|b
C->d|Ab|bC
Back