Sarmiento de Resistencia
Club Atlético Sarmiento is an Argentine sports club based in the city of Resistencia in Chaco Province. Although many sports are hosted at the club, Sarmiento is mostly known for its football team, which currently plays in Torneo Argentino B, the regionalised fourth level of the Argentine football league system.
| Full name | Club Atlético Sarmiento | ||
|---|---|---|---|
| Nickname(s) | Decano, Aurirrojo | ||
| Founded | 24 September 1910 | ||
| Ground | Estadio Centenario, Resistencia, Chaco | ||
| Chairman | Jorge Capitanich | ||
| Manager | Raúl Chaparro | ||
| League | Torneo Argentino B | ||
| 2011–12 | 19th. | ||
| Website | Club website | ||
|
| |||
Sarmiento played one season at the highest level of Argentine football, in the Torneo Nacional of 1977. Sarmiento finished 6th out of 8 teams in group C. The highlights of that campaign included a 2–0 win over Racing Club and 1–1 draws with River Plate and eventual finalist Talleres de Córdoba.
Other sports practised at the club are basketball, field hockey, martial arts, swimming, tennis and volleyball,
Titles
- 1977
gollark: These are done → muahahaha.
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)```
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.