Grammars and parsing with C# 2.0

Short Description
with C# 2.0. Peter Sestoft. ??. sestoft@dina.kvl.dk. and. Ken Friis Larsen. ?. ken@friislarsen.net. 2006-08-31. ?. Based on earlier versions for Standard …

Website: www.itu.dk | Filesize: 324kb

Content
Grammars and parsing with C# 2.0
Peter Sestoft?
sestoft@dina.kvl.dk
and Ken Friis Larsen?
ken@friislarsen.net
2006-08-31
Based on earlier versions for Standard ML and for Java.
?Department of Mathematics and Physics, Royal Veterinary and Agricultural University, Denmark.
?IT University of Copenhagen, Denmark.Contents
1 Grammars and Parsing 3
2 Grammars 4
2.1 Grammar notation 4
2.2 Derivation 4
3 Parsing theory 6
3.1 Parsing: reconstruction of a derivation tree 6
3.2 A more machine-oriented view of parsing 8
3.3 Left factorization 9
3.4 Left recursive nonterminals 10
3.5 First-sets, follow-sets and selection sets 11
3.6 Summary of parsing theory 15
4 Parser construction in C# 16
4.1 C# representation of input strings 16
4.2 Constructing parsing methods in C# 17
4.3 Parsing methods follow the derivation tree 20
4.4 Summary of parser construction 20
5 Scanners 21
5.1 Character classification methods 21
5.2 Scanning names 22
5.3 Distinguishing names from keywords 23
5.4 Scanning floating-point numerals 24
5.5 Reading string and text files with C# 26
5.6 Summary of scanners 26
6 Parsers with attributes 27
6.1 Constructing attributed parsers 27
6.2 Building representations of input 30
6.3 Summary of parsers with attributes 33
7 A larger example: arithmetic expressions 34
7.1 A grammar for arithmetic expressions 34
7.2 The parser constructed from the grammar 35
7.3 A scanner for arithmetic expressions 36
7.4 Evaluating arithmetic expressions 37
8 Some background 38
8.1 History and notation 38
8.2…