CSCI 161 Study Guide - Midterm Guide: Context-Free Language, Barclays Africa Group, Noam Chomsky

• School: Santa Clara University
• Department: Computer Science
• Course: CSCI 161
• Professor: Sara Krehbiel

Document Summary

Cfb : g = ( uno ? s rnsd- start var finite set of j variables terminals : finite set disjoint from v ( no common elements ) Pda : m = ( e , i , 8: , e ) finite sets ) etc, 9 . F- { o , : 9 . E is the input alphabet e. g . E = { 0,13 or eas b 3. 8 : q x ie x te pcq xf ) is thetransitionfunction. 90 e q is the start state. Fe q is the set of accept states. Any language that can be generated by a context-free grammar ( cfb) is context -free language ( cfl) . *tip : many cfl are unions of smaller cf ls: computation histories map at all possibilities ? understanding parsetreeslberiuati. ms using an example. * 0*1 suppose gi ih a b.