List of places named Cheyenne
Places named after the Cheyenne are:
Places
Colorado
Boulder County
- Cheyenne Arapaho Hall, a building at the University of Colorado in Boulder
El Paso County
- Cheyenne Creek, Colorado
- Cheyenne Mountain, a Colorado mountain and military complex
- Cheyenne Lodge, alternate name for the Cheyenne Mountain Lodge on Cheyenne Mountain
- Cheyenne Spring House, an 1890s building enclosing one of the Manitou Mineral Springs
- North Cheyenne Cañon Park, a city-owned park including area outside both the North and South canons (Cheyenne Park and Stratton Park in 1900)
- South Cheyenne Cañon, a landform near Colorado Springs with private toll road from the Pillars of Hercules to Seven Falls
Cheyenne County
- Cheyenne County, Colorado, the 1889 area created from portions of Elbert and Bent counties
- Cheyenne County Courthouse (Colorado), a 1908 building in Cheyenne Wells
- Cheyenne County Jail, an 1894 building in Cheyenne Wells
- Cheyenne Wells, Colorado, the Cheyenne County seat
Kansas
Montana
- Northern Cheyenne Indian Reservation in Montana
Nebraska
Oklahoma
- Cheyenne, Oklahoma, a town in Roger Mills County, Oklahoma
South Dakota
- Cheyenne Creek (South Dakota)
- Cheyenne River, in Wyoming and South Dakota
- Cheyenne River Indian Reservation in South Dakota
Wyoming
- Cheyenne, Wyoming, the capital of Wyoming
- Cheyenne belt, a tectonic suture zone
- Cheyenne River, in Wyoming and South Dakota
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.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
gollark: This will allow 3% more efficient harnessing of character set anomalies.
gollark: The parser supports anomalous unicode, muahaha.
See also
- Cheyenne (disambiguation)
- Cheyenne County (disambiguation)
- Cheyenne Township (disambiguation)
- All pages with titles containing Cheyenne
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.