The House of Arden
The House of Arden is a novel for children, written in 1908 by English author Edith Nesbit.
 Early edition cover | |
| Author | Edith Nesbit |
|---|---|
| Illustrator | H. R. Millar |
| Country | United Kingdom |
| Language | English |
| Genre | Fantasy, Children's Novel |
| Publisher | T. Fisher Unwin |
Publication date | 1908 |
| Media type | Print (hardback & paperback) |
| Followed by | Harding's Luck |
Plot summary
Two impoverished children, Edred and Elfrida Arden, inherit the decrepit Arden Castle and search for the lost family fortune that will allow them to rebuild it. With the assistance of the magical Mouldiwarp, they travel back in time to earlier periods of English history, searching for clues.
Allusions and references in The House of Arden
During their journeys into the past, the children encounter several historical events:
- 1807: Napoleon's planned invasion of the United Kingdom, the British military response, and the smuggling around Dymchurch Bay (called "Lymchurch" in the story)
- ca. 1705: a visit from the "Chevalier St. George" (the Old Pretender) during the reign of Queen Anne
- 1605: the Gunpowder Plot and a meeting with Sir Walter Raleigh in the Tower of London, from which the children escape using the same stratagem Lady Nithsdale would use in 1717
- ca. 1535: a May Day celebration with Anne Boleyn and Henry VIII, with premonitions of Anne's execution.
The final episode, in which the children rescue their father from a lost civilization in South America, is reminiscent of the legends of El Dorado and other Cities of Gold.
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
- HTML text with original illustrations, at UPenn
- The House of Arden at Faded Page (Canada)
- The House of Arden at Google Books
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.