2008 GP Ouest–France

2008 GP Ouest-France
2008 UCI ProTour, race 12 of 15
Race details
Dates	August 25
Stages	1
Distance	229.2 km (142.4 mi)
Winning time	5h 42' 44"
Results

The 2008 GP Ouest-France cycling road race took place on August 25, 2008 in France and was won by Pierrick Fédrigo of Bouygues Télécom.

Results

	Cyclist	Team	Time
1	Pierrick Fédrigo (FRA)	Bouygues Télécom	5h 42' 44"
2	Alessandro Ballan (ITA)	Lampre	s.t.
3	David López (ESP)	Caisse d'Epargne	+3"
4	Allan Davis (AUS)	Mitsubishi-Jartazi	+13"
5	José Joaquín Rojas (ESP)	Caisse d'Epargne	s.t.
6	Arnaud Gérard (FRA)	Française des Jeux	s.t.
7	Greg Van Avermaet (BEL)	Silence–Lotto	s.t.
8	Romain Feillu (FRA)	Agritubel	s.t.
9	Geoffroy Lequatre (FRA)	Agritubel	s.t.
10	Manuele Mori (ITA)	Scott–American Beef	s.t.

gollark: ... also array literals, bee their bad docs.

gollark: Please also give me write access to the repo.

gollark: Oh, right, array indexing.

gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```

gollark: <@332271551481118732> Expression parsing is done, I think.

External links

2008 in Road Cycling

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.