TAILIEUCHUNG - Lecture Theory of automata - Lecture 42
Row language, nonterminals defined from summary table, productions defined by rows, rules for defining productions, all possible productions of CFG for row language of the example under consideration, CFG corresponding to the given PDA. | Recap lecture 41 Recap of PDA in conversion form, example of PDA in conversion form, joints of the machine, new pictorial representation of PDA in conversion form, summary table, row sequence, row language. Note As has already been discussed that the Row language is the language whose alphabet = {Row1, Row2, , Row7}, for the example under consideration, so to determine the CFG of Row language, the nonterminals of this CFG are introduced in the following form Net(X, Y, Z) where X and Y are joints and Z is any STACK character. Following is an example of Net(X, Y, Z) Example continued PH a PP PP Z PH b b PP a If the above is the path segment between two joints then, the net STACK effect is same as POP Z. For a given PDA, some sets of all possible sentences Net(X, Y, Z) are true, while other are false. For this purpose every row of the summary table is examined whether the net effect of popping is exactly one letter. Example continued Consider the Row4 of the summary table .
đang nạp các trang xem trước
