WebFund 2015W Lecture 19

Video

The video for the lecture given on Wednesday, March 18, 2015 is now available.

Notes

In Lecture

Regular Expressions

 - comes out of formal language theory, originally from linguistics, but adopted by computer scientists

 - how do you represent the structure of natural languages?
   - how do you "parse" languages?
 - parse using rules

 - in CS, a "grammar" is a set of rules specifying a "language"
   - all syntax, no meaning
   - is this a valid X, where X is...English?  more likely C or Java
 - simplest languages are things like LISP
   (blah (blah blah blah) )
 - most common: C-like syntax
   Java, C++, JavaScript, Perl (sort of)

 - not all grammars are the same
 - some are more "powerful" than others
 - this is the stuff of 3803

Deploying Web Apps
------------------

* get a domain name (DNS)
  - go to the right registrar - is it .ca, .com, .sucks
* get a DNS provider/server
  - maintain DB for your domain
* get a hosting provider (machine to run web code)

You can get all three from certain providers

Don't do your own DNS server
you *can* do your own web server
How?
 - just run it on port 80