tsunami
log in
email
password
links
newest items
tag list
syntax reference
tag:tsunami
history
DDL Trigger: database level events
My Research
html file input and javascript
thoughts on wikis
Luke's FPGA work
Thoughts on Information Classification
item name
tags
CS21 {{ A CFG grammar: A → AA A → (A) A → ε Proof that we always generate balanced expressions: A → AA →* xy by induction, xy is balanced if x and y are balanced A → (A) →* (x) by induction, (x) is balanced if x is balanced Proof that any balanced expression can be represented by our grammar: Consider the shortest prefix that is balanced: 1. if it is the whole string, it has a ( on the left and ) on the right we can use the rule A → (A) →* (x) 2. otherwise we can use the rule A → AA }}
some permissive license goes here
contact