Anson Harrold

Anson Forney Harrold (March 10, 1870 – April 18, 1907) was an American football player and coach. He served as the first head football coach at the University of Pittsburgh, then known as Western University of Pennsylvania. He led the school to a 1–4 record in 1893. Aside from coaching, Harrold also played football for Franklin & Marshall College, from which he graduated from in 1889 and Princeton University, where he attended from 1890 until graduating in 1893.

Anson Harrold
Biographical details
Born(1870-03-10)March 10, 1870
Manor, Pennsylvania
DiedApril 18, 1907(1907-04-18) (aged 37)
Barrington, Rhode Island
Playing career
1888–1889Franklin & Marshall
1891–1892Princeton
Position(s)Tackle
Coaching career (HC unless noted)
1893Western U. of Pennsylvania
Head coaching record
Overall1–4

Work outside football

Outside football he worked as a design engineer for 15 years at Westinghouse Electric. He also helped organize the Pittsburgh Transformer Company and worked there for three years. He also became the President of the American Transformer Company, based in Newark, New Jersey.

Family

On September 12, 1893, he married Maude Hubley of Lancaster, Pennsylvania. The couple had one daughter, Elisabeth. Elisabeth married Jesse Gearing Johnson of Bridgton, NJ and they settled in Norfolk, Va.

Death

Harrold died on April 18, 1907, from tuberculosis.[1] He spent the last year of his life trying to regain his health, spending his last summer and fall in the woods of Maine and his last winter in Camden, South Carolina.

Head coaching record
Year Team Overall ConferenceStanding Bowl/playoffs
Western University of Pennsylvania (Independent) (1893)
1893 Western University of Pennsylvania 1–4
Western University of Pennsylvania: 1–4
Total:1–4
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.

References
  1. "Anson F. Harrold" (PDF). The New York Times. April 19, 1907. Retrieved March 23, 2011.

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