CS 4510 Lecture Notes - Lecture 8: Open Archives Initiative, Parsing, Electrocardiography
Document Summary
* regular languages could be described by dfa "s. , regular expressions , and now regular grammars . * context - free grammars :(cfg ) push down automatons cpda) ex . 3 a oaii b grammar is kind of nondeterministic. 0,1 , # are terminal variable (cid:15482) usually have a start symbol , aib , but let a- be the start . A oai 00a 11 000a 111 000131117000# 111 (cid:8869) we end w/ a swing of terminals , 000 # 121 e x we pay g. , generates 03 # 13 & define 4g) to be all porringer generated by g . Kfz ) - eon # i 1h20 } b/c it is generated by a context-free grammar . to lce z ) is a context-free language. * 5- 000 # 111 ekg # ) there is a parse tree that describes the derivation of s. 4 is a set of variables ,
