Hi stuh505
Not sure how much help this will be.
For hand parsing little languages the best tutorial i've seen is in bjarne stroustrops c++ 3rd edition ( possibly other editions also ). He goes through a fairly nice walkthrough of mapping a desk-top calculator from grammar to code generation with a hand-coded lexer and parser ( recursive descent ). It's pretty cool.
If your language is suitable for recursive descent ( is that what LL(1) means, i can't remember

), small enough, and you don't need to be super efficient then that's probably the way to go. The code ends up as a fairly direct mapping of the grammar, so drops out quite cleanly in my experience.
wrt automatic lexers and parsers, the only ones i've ( limited )experience with are Lex and Yacc. Many compiler books go into detail on these , and there will be loads of stuff on the internet ( google for "lex yacc tutorial" etc ).