Include [SaffronAG, SaffronBaseDecls]; NoopMethods1: Module = Begin for Junk: AbstractProduction [ ] let foo[tree] _ 0 ; for Num.decimal: AbstractProduction [ Decimalnum ] let foo[tree] _ 0 ; for Num.octal: AbstractProduction [ Octalnum ] let foo[tree] _ 0 ; for Num.hex: AbstractProduction [ Hexnum ] let foo[tree] _ 0 ; for AddOp.plus: AbstractProduction [ ] let foo[tree] _ 0 ; for AddOp.minus: AbstractProduction [ ] let foo[tree] _ 0 ; for MultOp.times: AbstractProduction [ ] let foo[tree] _ 0 ; for MultOp.divide: AbstractProduction [ ] let foo[tree] _ 0 ; for MultOp.mod: AbstractProduction [ ] let foo[tree] _ 0 ; for SelectHead.plain: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for SelectHead.discriminating: AbstractProduction [ BindItem, OptExp ] let foo[tree] _ 0 ; for SelectExpList.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for SelectExpList.more: AbstractProduction [ SelectExpList, SelectExpItem ] let foo[tree] _ 0 ; for SelectExpItem: AbstractProduction [ SelectLabel, Exp ] let foo[tree] _ 0 ; for SelectLabel.type: AbstractProduction [ Ident, TypeExp ] let foo[tree] _ 0 ; for SelectLabel.test: AbstractProduction [ SelectTestList ] let foo[tree] _ 0 ; for SelectTestList.one: AbstractProduction [ Relation ] let foo[tree] _ 0 ; for SelectTestList.more: AbstractProduction [ SelectTestList, Relation ] let foo[tree] _ 0 ; for BindList.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for BindList.more: AbstractProduction [BindList, BindItem ] let foo[tree] _ 0 ; for BindItem.named: AbstractProduction [Id, Exp ] let foo[tree] _ 0 ; for BindItem.unnamed: AbstractProduction [ Exp ] let foo[tree] _ 0 ; End; NoopMethods2: Module = Begin for Relation.negative: AbstractProduction [ RelationTail ] let foo[tree] _ 0 ; for Relation.positive: AbstractProduction [ RelationTail ] let foo[tree] _ 0 ; for RelationTail.range: AbstractProduction [ Range ] let foo[tree] _ 0 ; for RelationTail.relop: AbstractProduction [ Relop, Exp ] let foo[tree] _ 0 ; for Relop.eq: AbstractProduction [ ] let foo[tree] _ 0 ; for Relop.ne: AbstractProduction [ ] let foo[tree] _ 0 ; for Relop.lt: AbstractProduction [ ] let foo[tree] _ 0 ; for Relop.le: AbstractProduction [ ] let foo[tree] _ 0 ; for Relop.gt: AbstractProduction [ ] let foo[tree] _ 0 ; for Relop.ge: AbstractProduction [ ] let foo[tree] _ 0 ; for Range.typeid: AbstractProduction [ TypeId ] let foo[tree] _ 0 ; for Range.subrange: AbstractProduction [ Subrange ] let foo[tree] _ 0 ; for Catch: AbstractProduction [ CatchCaseList, CatchAny ] let foo[tree] _ 0 ; for CatchAny.absent: AbstractProduction [ ] let foo[tree] _ 0 ; for CatchAny.present: AbstractProduction [ Statement ] let foo[tree] _ 0 ; for CatchCaseList.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for CatchCaseList.more: AbstractProduction [ CatchCaseList, CatchCase ] let foo[tree] _ 0 ; for CatchCase: AbstractProduction [ SignalList, Statement ] let foo[tree] _ 0 ; for SignalList.one: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for SignalList.more: AbstractProduction [ SignalList, Exp ] let foo[tree] _ 0 ; for ExpList.keylist: AbstractProduction [ KeyList ] let foo[tree] _ 0 ; for ExpList.orderlist: AbstractProduction [ OrderList ] let foo[tree] _ 0 ; for KeyList.one: AbstractProduction [ KeyItem ] let foo[tree] _ 0 ; for KeyList.more: AbstractProduction [ KeyList, KeyItem ] let foo[tree] _ 0 ; for KeyItem: AbstractProduction [ Id, OptExp ] let foo[tree] _ 0 ; for OrderList.one: AbstractProduction [ OptExp ] let foo[tree] _ 0 ; for OrderList.more: AbstractProduction [ OrderList, OptExp ] let foo[tree] _ 0 ; for OptExp.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for OptExp.trash: AbstractProduction [ ] let foo[tree] _ 0 ; for OptExp.exp: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for Qualifier.prefixop: AbstractProduction [ PrefixOp ] let foo[tree] _ 0 ; for Qualifier.typeop: AbstractProduction [ TypeOp ] let foo[tree] _ 0 ; for Qualifier.size: AbstractProduction [ ] let foo[tree] _ 0 ; for Qualifier.bits: AbstractProduction [ ] let foo[tree] _ 0 ; for Qualifier.bytes: AbstractProduction [ ] let foo[tree] _ 0 ; for Qualifier.units: AbstractProduction [ ] let foo[tree] _ 0 ; for Qualifier.words: AbstractProduction [ ] let foo[tree] _ 0 ; for Qualifier.apply: AbstractProduction [ ExpList, Catch ] let foo[tree] _ 0 ; for Qualifier.select: AbstractProduction [ Id ] let foo[tree] _ 0 ; for Qualifier.indirect: AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.long : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.abs : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.pred : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.succ : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.ord : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.min : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.max : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.base : AbstractProduction [ ] let foo[tree] _ 0 ; for PrefixOp.length : AbstractProduction [ ] let foo[tree] _ 0 ; for TypeOp.code: AbstractProduction [ ] let foo[tree] _ 0 ; for TypeOp.first: AbstractProduction [ ] let foo[tree] _ 0 ; for TypeOp.last: AbstractProduction [ ] let foo[tree] _ 0 ; for TypeOp.nil: AbstractProduction [ ] let foo[tree] _ 0 ; End; NoopMethods3: Module = Begin for New.plain: AbstractProduction [ ] let foo[tree] _ 0 ; for New.zoned: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for Cons.plain: AbstractProduction [ ] let foo[tree] _ 0 ; for Cons.zoned: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for ListCons.plain: AbstractProduction [ ] let foo[tree] _ 0 ; for ListCons.zoned: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for DescList.explicitlength: AbstractProduction [ Exp.base, Exp.length, OptType ] let foo[tree] _ 0 ; for DescList.defaultlength: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for Initialization.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for Initialization.binding: AbstractProduction [ InitialValue ] let foo[tree] _ 0 ; for Initialization.assignment: AbstractProduction [ InitialValue ] let foo[tree] _ 0 ; for InitialValue.trash: AbstractProduction [ ] let foo[tree] _ 0 ; for InitialValue.code: AbstractProduction [ ] let foo[tree] _ 0 ; for InitialValue.exp: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for InitialValue.block: AbstractProduction [ Checked, Inline, Block ] let foo[tree] _ 0 ; for InitialValue.machinecode: AbstractProduction [ Checked, CodeList ] let foo[tree] _ 0 ; for Checked.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for Checked.checked: AbstractProduction [ ] let foo[tree] _ 0 ; for Checked.trusted: AbstractProduction [ ] let foo[tree] _ 0 ; for Checked.unchecked: AbstractProduction [ ] let foo[tree] _ 0 ; for Inline.yes: AbstractProduction [ ] let foo[tree] _ 0 ; for Inline.no: AbstractProduction [ ] let foo[tree] _ 0 ; for CodeList.one: AbstractProduction [ OrderList ] let foo[tree] _ 0 ; for CodeList.more: AbstractProduction [ CodeList, OrderList ] let foo[tree] _ 0 ; for TransferOp.signal: AbstractProduction [ ] let foo[tree] _ 0 ; for TransferOp.error: AbstractProduction [ ] let foo[tree] _ 0 ; for TransferOp.start: AbstractProduction [ ] let foo[tree] _ 0 ; for TransferOp.join: AbstractProduction [ ] let foo[tree] _ 0 ; for TransferOp.new: AbstractProduction [ ] let foo[tree] _ 0 ; for TransferOp.fork: AbstractProduction [ ] let foo[tree] _ 0 ; End; NoopMethods4: Module = Begin for OptStatement.absent: AbstractProduction [ ] let foo[tree] _ 0 ; for OptStatement.present: AbstractProduction [ Statement ] let foo[tree] _ 0 ; for SelectStmtList.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for SelectStmtList.more: AbstractProduction [ SelectStmtList, SelectStmtItem ] let foo[tree] _ 0 ; for SelectStmtItem: AbstractProduction [ SelectLabel, Statement ] let foo[tree] _ 0 ; End; NoopMethods5: Module = Begin for Entry.entry: AbstractProduction [ ] let foo[tree] _ 0 ; for Entry.internal: AbstractProduction [ ] let foo[tree] _ 0 ; for Entry.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for ExitList.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for ExitList.more: AbstractProduction [ ExitList, ExitItem ] let foo[tree] _ 0 ; for ExitItem: AbstractProduction [ IdList, Statement ] let foo[tree] _ 0 ; for ForClause.assignation: AbstractProduction [ ControlId, Exp.initial, Exp.next ] let foo[tree] _ 0 ; for ForClause.iteration: AbstractProduction [ ControlId, Decreasing, Range ] let foo[tree] _ 0 ; for ForClause.repetition: AbstractProduction [ Range ] let foo[tree] _ 0 ; for ForClause.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for ControlId.new: AbstractProduction [ Ident, TypeExp ] let foo[tree] _ 0 ; for ControlId.old: AbstractProduction [ Id ] let foo[tree] _ 0 ; for Decreasing.yes: AbstractProduction [ ] let foo[tree] _ 0 ; for Decreasing.no: AbstractProduction [ ] let foo[tree] _ 0 ; for DoTest.until: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for DoTest.while: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for DoTest.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for DoExit: AbstractProduction [ ExitList, OptStatement ] let foo[tree] _ 0 ; for OptArgs.explist: AbstractProduction [ ExpList ] let foo[tree] _ 0 ; for OptArgs.exp: AbstractProduction [ Exp ] let foo[tree] _ 0 ; for OptArgs.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.signal: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.error: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.returnwitherror: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.start: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.restart: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.join: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.notify: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.broadcast: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.transferwith: AbstractProduction [ ] let foo[tree] _ 0 ; for Transfer.returnwith: AbstractProduction [ ] let foo[tree] _ 0 ; for Free.plain: AbstractProduction [ ] let foo[tree] _ 0 ; for Free.zoned: AbstractProduction [ Exp ] let foo[tree] _ 0 ; End; NoopMethods6: Module = Begin for DefHead: AbstractProduction [ Locks, ModuleList, Shares, Access ] let foo[tree] _ 0 ; for Cedar.yes: AbstractProduction [ ] let foo[tree] _ 0 ; for Cedar.no: AbstractProduction [ ] let foo[tree] _ 0 ; for ProgHead: AbstractProduction [ Safe, Class, Arguments, Locks, Interface, Access ] let foo[tree] _ 0 ; for Class.program: AbstractProduction [ ] let foo[tree] _ 0 ; for Class.monitor: AbstractProduction [ ] let foo[tree] _ 0 ; for Interface: AbstractProduction [ ModuleList.imports, ModuleList.exports, Shares ] let foo[tree] _ 0 ; for ModuleList.empty: AbstractProduction [ ] let foo[tree] _ 0 ; for ModuleList.more: AbstractProduction [ ModuleList, ModuleItem ] let foo[tree] _ 0 ; for ModuleItem.one: AbstractProduction [ Id ] let foo[tree] _ 0 ; for ModuleItem.two: AbstractProduction [ Id.record, Id.type ] let foo[tree] _ 0 ; for Shares.absent: AbstractProduction [ ] let foo[tree] _ 0 ; for Shares.present: AbstractProduction [ IdList ] let foo[tree] _ 0 ; for Locks.absent: AbstractProduction [ ] let foo[tree] _ 0 ; for Locks.present: AbstractProduction [ Exp, Lambda ] let foo[tree] _ 0 ; for Lambda.absent: AbstractProduction [ ] let foo[tree] _ 0 ; for Lambda.present: AbstractProduction [ Ident, TypeExp ] let foo[tree] _ 0 ; End. ŒSaffronNoops.ThreeC4 Copyright Σ 1987 by Xerox Corporation. All rights reserved. Shoup, August 8, 1986 5:32:07 pm PDT Bill Jackson (bj) April 28, 1987 0:26:13 am PDT Sturgis, July 20, 1987 7:05:44 pm PDT Lucy Hederman August 17, 1987 3:49:34 pm PDT Junk: AbstractType [ foo ]; Num: AbstractType [ foo ]; AddOp: AbstractType [ foo ]; MultOp: AbstractType [ foo ]; SelectHead: AbstractType [ foo ]; SelectExpList: AbstractType [ foo ]; SelectExpItem: AbstractType [ foo ]; SelectLabel: AbstractType [ foo ]; SelectTestList: AbstractType [ foo ]; Relation: AbstractType [ foo ]; RelationTail: AbstractType [ foo ]; Relop: AbstractType [ foo ]; Range: AbstractType [ foo ]; Catch: AbstractType [ foo ]; CatchAny: AbstractType [ foo ]; CatchCaseList: AbstractType [ foo ]; CatchCase: AbstractType [ foo ]; SignalList: AbstractType [ foo ]; ExpList: AbstractType [ foo ]; KeyList: AbstractType [ foo ]; KeyItem: AbstractType [ foo ]; OrderList: AbstractType [ foo ]; OptExp: AbstractType [ foo ]; Qualifier: AbstractType [ foo ]; PrefixOp: AbstractType [ foo ]; TypeOp: AbstractType [ foo ]; New: AbstractType [ foo ]; Cons: AbstractType [ foo ]; ListCons: AbstractType [ foo ]; DescList: AbstractType [ foo ]; Initialization: AbstractType [ foo ]; InitialValue: AbstractType [ foo ]; Checked: AbstractType [ foo ]; Inline: AbstractType [ foo ]; CodeList: AbstractType [ foo ]; TransferOp: AbstractType [ foo ]; OptStatement: AbstractType [ foo ]; SelectStmtList: AbstractType [ foo ]; SelectStmtItem: AbstractType [ foo ]; Entry: AbstractType [ foo ]; ExitList: AbstractType [ foo ]; ExitItem: AbstractType [ foo ]; ForClause: AbstractType [ foo ]; ControlId: AbstractType [ foo ]; Decreasing: AbstractType [ foo ]; DoTest: AbstractType [ foo ]; DoExit: AbstractType [ foo ]; OptArgs: AbstractType [ foo ]; Transfer: AbstractType [ foo ]; Free: AbstractType [ foo ]; DefHead: AbstractType [ foo ]; Cedar: AbstractType [ foo ]; ProgHead: AbstractType [ foo ]; Class: AbstractType [ foo ]; Interface: AbstractType [ foo ]; ModuleList: AbstractType [ foo ]; ModuleItem: AbstractType [ foo ]; Shares: AbstractType [ foo ]; Locks: AbstractType [ foo ]; Lambda: AbstractType [ foo ]; eof... Κ²•StyleDef€BeginStyle (cedar) AttachStyle (codetab) (set up the fancy tabs) {code clearTabStops 35 sp flushLeft tabStop} StyleRule EndStyle˜codešœ™K™;Kšœ!Οk™$Kšœ/™/K™%K™,—K˜Jšœ&˜&J˜šΟn œ˜headšΠnzΟz™codetabšΠizœžœ‘œ˜ š‘œ ˜J˜—Kšœ˜——š ™š‘œΟb ‘œ˜2š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ ˜.š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ ˜*š‘œ ˜Mšœ˜—Mšœ˜——š ™š‘œ’ ‘œ˜&š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜'š‘œ ˜Mšœ˜—Mšœ˜——š ™š‘œ’‘œ˜(š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜&š‘œ ˜Mšœ˜—Mšœ˜——š !™!š‘œ’‘œ˜0š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜Fš‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™$š‘œ’‘œ˜/š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ!˜Kš‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™$š‘œž‘œ˜:š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™"š‘œ’‘œ˜;š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜;š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™%š‘œ’‘œ ˜7š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜Hš‘œ ˜Mšœ˜—Mšœ˜M˜—šœ‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—šœ ’œ‘œ˜;š‘œ ˜Mšœ˜—Mšœ˜—šœ’œ‘œ ˜1š‘œ ˜Mšœ˜—Mšœ˜—šœ’œ‘œ˜0š‘œ ˜Mšœ˜—Mšœ˜—K˜—K˜K˜—šž œ˜šŸ ™š‘œ’‘œ˜:š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜:š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™#š‘œ’‘œ ˜4š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜9š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’ ‘œ˜$š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜$š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜$š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜$š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜$š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜$š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ ˜/š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ ˜3š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œž‘œ˜9š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜6š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™$š‘œ’‘œ˜/š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜Gš‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™ š‘œž ‘œ˜;š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™!š‘œ’‘œ˜.š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜;š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ ˜3š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜7š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’ ‘œ ˜/š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜9š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œž ‘œ˜.š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™ š‘œ’‘œ ˜0š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜<š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜(š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜(š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™ š‘œ’‘œ ˜7š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ ˜3š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜:š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜/š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜.š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’ ‘œ˜'š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜(š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜'š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜&š‘œ ˜Mšœ˜—Mšœ˜—K˜—K˜K˜—šž œ˜šŸ ™š‘œ’ ‘œ˜%š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’ ‘œ˜&š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜.š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ"˜Qš‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜6š‘œ ˜Mšœ˜—Mšœ˜——š %™%š‘œ’‘œ˜0š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜?š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜Bš‘œ ˜Mšœ˜—Mšœ˜——š #™#š‘œ’‘œ˜.š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜-š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜0š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜Eš‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜Fš‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜-š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’ ‘œ˜&š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜%š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜2š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜=š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™!š‘œ’‘œ˜-š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ Ρbiz’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—K˜—K˜K˜—šž œ˜šŸ  ™#š‘œ’‘œ˜/š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜:š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™%š‘œ’‘œ˜0š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ#˜Nš‘œ ˜Mšœ˜—Mšœ˜——šŸ ™%š‘œž‘œ˜Aš‘œ ˜Mšœ˜—Mšœ˜——K˜K˜—šž œ˜šŸ ™š‘œ’ ‘œ˜'š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜'š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜<š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œž ‘œ˜6š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™ š‘œ’‘œ%˜Rš‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ!˜Lš‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ ˜6š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™ š‘œ’‘œ˜8š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™!š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜(š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œž‘œ˜9š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ ˜3š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜4š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜+š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜.š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜1š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜/š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’ ‘œ˜&š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜*š‘œ ˜Mšœ˜—Mšœ˜—K˜—K˜K˜—šž œ˜šŸ ™š‘œž ‘œ&˜Eš‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’ ‘œ˜%š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’ ‘œ˜$š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œž ‘œ5˜Uš‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™ š‘œž ‘œ3˜Tš‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™!š‘œ’‘œ˜,š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜Bš‘œ ˜Mšœ˜—Mšœ˜——šŸ  ™!š‘œ’‘œ˜-š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜=š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ ˜1š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜(š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜5š‘œ ˜Mšœ˜—Mšœ˜——šŸ ™š‘œ’‘œ˜)š‘œ ˜Mšœ˜—Mšœ˜—š‘œ’‘œ˜9š‘œ ˜Mšœ˜—Mšœ˜—K˜—J˜—K˜K™K™—…—,€QΎ