The Repercussions of a Badly Planned Suicide

The Repercussions of a Badly Planned Suicide is the debut album from UK metalcore band Johnny Truant.

The Repercussions Of A Badly Planned Suicide
Studio album by
Johnny Truant
Released2002
RecordedAt Philia Studios Oxon, UK
GenreMetalcore
Length48:50
LabelUndergroove Records
Johnny Truant chronology
The Repercussions Of A Badly Planned Suicide
(2002)		 In the Library of Horrific Events
(2005)

Track listing
  1. "I Am The Primitologist Mr Robert Sapolsky" – 5:22
  2. "Consider Us Dead" – 6:52
  3. "Subtracting The Apex" – 7:01
  4. "Seven Days At Knife Point" – 4:42
  5. "Infamy" – 5:01
  6. "Puparia" – 9:53
  7. "In The Name Of Bleeding Hearts" – 9:56

Writing Credits
  • All music written and composed by Johnny Truant.
  • All lyrics written by Olly Mitchell.

Personnel

Band members

Other personnel
  • Joe Gibb – mixing, mastering
  • Stuart Lee – additional vocals on "Seven Days At Knife Point"
  • Tim Machin – additional vocals on "Consider Us Dead"
  • Aaron Turner – album cover art
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.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.