Fred Barker (footballer)
Frederick John Austin Barker (31 October 1903 – 6 May 1974) was an Australian rules footballer who played with Collingwood and Hawthorn in the Victorian Football League (VFL).[1]
| Fred Barker | |||
|---|---|---|---|
 Barker during his Hawthorn career | |||
| Personal information | |||
| Full name | Frederick John Austin Barker | ||
| Date of birth | 31 October 1903 | ||
| Place of birth | Clifton Hill, Victoria | ||
| Date of death | 6 May 1974 (aged 70) | ||
| Place of death | Ivanhoe, Victoria | ||
| Original team(s) | Fairfield | ||
| Height | 173 cm (5 ft 8 in) | ||
| Weight | 68 kg (150 lb) | ||
| Playing career1 | |||
| Years | Club | Games (Goals) | |
| 1925–26 | Collingwood | 2 (0) | |
| 1927–29 | Hawthorn | 29 (3) | |
| Total | 31 (3) | ||
|
1 Playing statistics correct to the end of 1929. | |||
| Sources: AFL Tables, AustralianFootball.com | |||
Notes
- Holmesby, Russell; Main, Jim (2014). The Encyclopedia of AFL Footballers: every AFL/VFL player since 1897 (10th ed.). Seaford, Victoria: BAS Publishing. p. 43. ISBN 978-1-921496-32-5.
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.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
External links
- Fred Barker's playing statistics from AFL Tables
- Fred Barker's profile at Collingwood Forever
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.