Explore >> Select a destination
|
You are here 
|
mmhaskell.com | ||
| | | | |
dennybritz.com
|
|
| | | | | The final code is on Github. | |
| | | | |
diego.codes
|
|
| | | | | Data Scientist. I like music, keyboards and Legos. Proficient in pop culture references and xkcd. | |
| | | | |
pbrisbin.com
|
|
| | | | | In Haskell, functions must always return the same consistent type. There is also no concept of nil or null built into the language. This is not meant to handicap you, and the expressiveness and polymorphic-ness of Haskell's types mean it certainly does not. One way to handle such situations where functions (conceptually) may or may not return a value is through the Maybe type. data Maybe a = Just a | Nothing Maybe is a perfect and simple solution for this situation. | |
| | | | |
www.abubalay.com
|
|
| | | [AI summary] The article explains the concepts of recursive descent and LR parsing while deriving practical parsing techniques like Pratt parsing from automaton theoretical foundations. | ||
