April 2010 - Pharo-dev - lists.pharo.org

Re: [Pharo-project] Legitimate syntax for # ... foo

by StÃ©phane Ducasse

Eliot cleaning some left over or glitches is always good. I think that this is what nicolas wanted to say. like ###f -> #f we could use that for another syntactic extension. #12 -> 12 is not really nice. or #foo::bar: Stef > VisualWorks accepts it just fine. > > # "hello" foo => #foo > > # "hello" (foo # "hello" foo) => #(#foo #foo) > > > It's just how the parser/scanner works now, but It wouldn't break much > code IMO if we stop supporting these weirdnesses. > > Nicolas > > 2010/4/29 Lukas Renggli <renggli(a)gmail.com>: > > Actually I didn't have all the latest code loaded in the open image. > > There is more, hold your breath: > > > > testSymbolNumbers > > #(('#1' 1) ('#12' 12) ('#12.3' 12.3) ('# 1' 1) ('##1' 1) ('#"bar"1' > > 1)) do: [ :pair | > > tree := RBParser parseExpression: pair first. > > self assert: tree value = pair second. > > self assert: tree start > 1. > > self assert: tree stop = pair first size ] > > > > On 29 April 2010 21:12, Lukas Renggli <renggli(a)gmail.com> wrote: > >>> # "helllooo" foo > >>> > >>> prints > >>> #foo > >>> > >>> is this correct? > >> > >> Probably not, but the standard compiler accepts it. So I had to patch > >> the parser of the refactoring engine to accept a whole series of > >> degraded constructs. Below a small collection of tests documenting > >> some of these strange things: > >> > >> testSymbolLiteral > >> | tree | > >> #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' #foo) > >> ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') > >> ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair > >> | > >> tree := RBParser parseExpression: pair first. > >> self assert: tree value = pair second. > >> self assert: tree start = 1. > >> self assert: tree stop = pair first size ] > >> > >> testStatements > >> | tree | > >> #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | ..' > >> 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. > >> bar' 2 2)) do: [ :each | > >> tree := RBParser parseExpression: each first. > >> self assert: tree statements size = each second. > >> self assert: tree periods size = each last ] > >> > >> testNumberParsing > >> | numbers node | > >> numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' -123) > >> ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) > >> ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) > >> ('2r1e8' 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' > >> -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). > >> numbers do: [ :spec | > >> node := RBParser parseExpression: spec first. > >> self assert: node token source = spec first. > >> self assert: node value = spec second ] > >> > >> Lukas > >> > >> -- > >> Lukas Renggli > >> www.lukas-renggli.ch > >> > > > > > > > > -- > > Lukas Renggli > > www.lukas-renggli.ch > > > > _______________________________________________ > > Pharo-project mailing list > > Pharo-project(a)lists.gforge.inria.fr > > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > > > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project

April 29, 2010

Re: [Pharo-project] Legitimate syntax for # ... foo

by Nicolas Cellier

2010/4/29 Eliot Miranda <eliot.miranda(a)gmail.com>: > > > On Thu, Apr 29, 2010 at 12:50 PM, Nicolas Cellier > <nicolas.cellier.aka.nice(a)gmail.com> wrote: >> >> I don't think any other st dialect would accept that syntax but Squeak. > > VisualWorks accepts it just fine. > # "hello" foo => #foo > # "hello" (foo # "hello" foo) => #(#foo #foo) > I think this is the way the language works. Â Relax. Â Celebrate its > weirdness. Â Don't sweat the petty stuff, pet the sweaty stuff: > http://www.popsci.com/gadgets/article/2010-04/exclusive-making-elements-one… Maybe I should relax about comment anywhere, but these: [Compiler evaluate: '#( # 2 # -2 )'] on: Error do: [:exc | exc return: nil]. [Compiler evaluate: '# -2'] on: Error do: [:exc | exc return: nil]. [Compiler evaluate: '#-2'] on: Error do: [:exc | exc return: nil]. [Compiler evaluate: '#$a'] on: Error do: [:exc | exc return: nil]. [Compiler evaluate: '##(1##)1)'] on: Error do: [:exc | exc return: nil]. would all return nil in VW, not so in Squeak. Also, I mind the difference of first two in Squeak. That's hardly predictable and much too weird to my own taste... Nicolas >> >> It's just how the parser/scanner works now, but It wouldn't break much >> code IMO if we stop supporting these weirdnesses. >> >> Nicolas >> >> 2010/4/29 Lukas Renggli <renggli(a)gmail.com>: >> > Actually I didn't have all the latest code loaded in the open image. >> > There is more, hold your breath: >> > >> > testSymbolNumbers >> > Â Â Â Â #(('#1' 1) ('#12' 12) ('#12.3' 12.3) ('# 1' 1) ('##1' 1) >> > ('#"bar"1' >> > 1)) do: [ :pair | >> > Â Â Â Â Â Â Â Â tree := RBParser parseExpression: pair first. >> > Â Â Â Â Â Â Â Â self assert: tree value = pair second. >> > Â Â Â Â Â Â Â Â self assert: tree start > 1. >> > Â Â Â Â Â Â Â Â self assert: tree stop = pair first size ] >> > >> > On 29 April 2010 21:12, Lukas Renggli <renggli(a)gmail.com> wrote: >> >>> # "helllooo" foo >> >>> >> >>> prints >> >>> #foo >> >>> >> >>> is this correct? >> >> >> >> Probably not, but the standard compiler accepts it. So I had to patch >> >> the parser of the refactoring engine to accept a whole series of >> >> degraded constructs. Below a small collection of tests documenting >> >> some of these strange things: >> >> >> >> testSymbolLiteral >> >> Â Â Â Â | tree | >> >> Â Â Â Â #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' >> >> #foo) >> >> ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') >> >> ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair >> >> | >> >> Â Â Â Â Â Â Â Â tree := RBParser parseExpression: pair first. >> >> Â Â Â Â Â Â Â Â self assert: tree value = pair second. >> >> Â Â Â Â Â Â Â Â self assert: tree start = 1. >> >> Â Â Â Â Â Â Â Â self assert: tree stop = pair first size ] >> >> >> >> testStatements >> >> Â Â Â Â | tree | >> >> Â Â Â Â #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | >> >> ..' >> >> 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. >> >> bar' 2 2)) do: [ :each | >> >> Â Â Â Â Â Â Â Â tree := RBParser parseExpression: each first. >> >> Â Â Â Â Â Â Â Â self assert: tree statements size = each second. >> >> Â Â Â Â Â Â Â Â self assert: tree periods size = each last ] >> >> >> >> testNumberParsing >> >> Â Â Â Â | numbers node | >> >> Â Â Â Â numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' >> >> -123) >> >> ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) >> >> ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) >> >> ('2r1e8' Â 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' >> >> -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). >> >> Â Â Â Â numbers do: [ :spec | >> >> Â Â Â Â Â Â Â Â node := RBParser parseExpression: spec first. >> >> Â Â Â Â Â Â Â Â self assert: node token source = spec first. >> >> Â Â Â Â Â Â Â Â self assert: node value = spec second ] >> >> >> >> Lukas >> >> >> >> -- >> >> Lukas Renggli >> >> www.lukas-renggli.ch >> >> >> > >> > >> > >> > -- >> > Lukas Renggli >> > www.lukas-renggli.ch >> > >> > _______________________________________________ >> > Pharo-project mailing list >> > Pharo-project(a)lists.gforge.inria.fr >> > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >> > >> >> _______________________________________________ >> Pharo-project mailing list >> Pharo-project(a)lists.gforge.inria.fr >> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >

April 29, 2010

Re: [Pharo-project] Legitimate syntax for # ... foo

by Eliot Miranda

On Thu, Apr 29, 2010 at 12:50 PM, Nicolas Cellier < nicolas.cellier.aka.nice(a)gmail.com> wrote: > I don't think any other st dialect would accept that syntax but Squeak. > VisualWorks accepts it just fine. # "hello" foo => #foo # "hello" (foo # "hello" foo) => #(#foo #foo) I think this is the way the language works. Relax. Celebrate its weirdness. Don't sweat the petty stuff, pet the sweaty stuff: http://www.popsci.com/gadgets/article/2010-04/exclusive-making-elements-one… It's just how the parser/scanner works now, but It wouldn't break much > code IMO if we stop supporting these weirdnesses. > > Nicolas > > 2010/4/29 Lukas Renggli <renggli(a)gmail.com>: > > Actually I didn't have all the latest code loaded in the open image. > > There is more, hold your breath: > > > > testSymbolNumbers > > #(('#1' 1) ('#12' 12) ('#12.3' 12.3) ('# 1' 1) ('##1' 1) > ('#"bar"1' > > 1)) do: [ :pair | > > tree := RBParser parseExpression: pair first. > > self assert: tree value = pair second. > > self assert: tree start > 1. > > self assert: tree stop = pair first size ] > > > > On 29 April 2010 21:12, Lukas Renggli <renggli(a)gmail.com> wrote: > >>> # "helllooo" foo > >>> > >>> prints > >>> #foo > >>> > >>> is this correct? > >> > >> Probably not, but the standard compiler accepts it. So I had to patch > >> the parser of the refactoring engine to accept a whole series of > >> degraded constructs. Below a small collection of tests documenting > >> some of these strange things: > >> > >> testSymbolLiteral > >> | tree | > >> #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' > #foo) > >> ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') > >> ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair > >> | > >> tree := RBParser parseExpression: pair first. > >> self assert: tree value = pair second. > >> self assert: tree start = 1. > >> self assert: tree stop = pair first size ] > >> > >> testStatements > >> | tree | > >> #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | > ..' > >> 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. > >> bar' 2 2)) do: [ :each | > >> tree := RBParser parseExpression: each first. > >> self assert: tree statements size = each second. > >> self assert: tree periods size = each last ] > >> > >> testNumberParsing > >> | numbers node | > >> numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' > -123) > >> ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) > >> ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) > >> ('2r1e8' 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' > >> -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). > >> numbers do: [ :spec | > >> node := RBParser parseExpression: spec first. > >> self assert: node token source = spec first. > >> self assert: node value = spec second ] > >> > >> Lukas > >> > >> -- > >> Lukas Renggli > >> www.lukas-renggli.ch > >> > > > > > > > > -- > > Lukas Renggli > > www.lukas-renggli.ch > > > > _______________________________________________ > > Pharo-project mailing list > > Pharo-project(a)lists.gforge.inria.fr > > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project > > > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >

April 29, 2010

[Pharo-project] gettext change set

by Hilaire Fernandes

So far, In the archive the change set of classes (may be there are more) extracted from Etoys for Gettext support. They should install fine in Pharo 1.1, however there are incompatibility issues, look like related to MethodReference protocole (in TranslatedReceiverFind>>findWordsWith:in: ) Probably more to discover after this one. To use the gettext protocol doc http://community.ofset.org/index.php/OLPC#How_can_I_export_the_.pot_file_fo… I use to install DrGeoII package then, try the gettext into it: TextDomainManager registerCategoryPrefix: 'DrGeoII' domain: 'DrGeoII'. ok GetTextExporter2 exportTemplate. fail If someone is interested by a pair hacking session in IRC, drop me a line. Hilaire

April 29, 2010

Re: [Pharo-project] Legitimate syntax for # ... foo

by StÃ©phane Ducasse

I would really like to get rid of that. It makes everything looking so brittle. Stef On Apr 29, 2010, at 9:50 PM, Nicolas Cellier wrote: > I don't think any other st dialect would accept that syntax but Squeak. > It's just how the parser/scanner works now, but It wouldn't break much > code IMO if we stop supporting these weirdnesses. > > Nicolas > > 2010/4/29 Lukas Renggli <renggli(a)gmail.com>: >> Actually I didn't have all the latest code loaded in the open image. >> There is more, hold your breath: >> >> testSymbolNumbers >> #(('#1' 1) ('#12' 12) ('#12.3' 12.3) ('# 1' 1) ('##1' 1) ('#"bar"1' >> 1)) do: [ :pair | >> tree := RBParser parseExpression: pair first. >> self assert: tree value = pair second. >> self assert: tree start > 1. >> self assert: tree stop = pair first size ] >> >> On 29 April 2010 21:12, Lukas Renggli <renggli(a)gmail.com> wrote: >>>> # "helllooo" foo >>>> >>>> prints >>>> #foo >>>> >>>> is this correct? >>> >>> Probably not, but the standard compiler accepts it. So I had to patch >>> the parser of the refactoring engine to accept a whole series of >>> degraded constructs. Below a small collection of tests documenting >>> some of these strange things: >>> >>> testSymbolLiteral >>> | tree | >>> #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' #foo) >>> ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') >>> ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair >>> | >>> tree := RBParser parseExpression: pair first. >>> self assert: tree value = pair second. >>> self assert: tree start = 1. >>> self assert: tree stop = pair first size ] >>> >>> testStatements >>> | tree | >>> #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | ..' >>> 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. >>> bar' 2 2)) do: [ :each | >>> tree := RBParser parseExpression: each first. >>> self assert: tree statements size = each second. >>> self assert: tree periods size = each last ] >>> >>> testNumberParsing >>> | numbers node | >>> numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' -123) >>> ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) >>> ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) >>> ('2r1e8' 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' >>> -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). >>> numbers do: [ :spec | >>> node := RBParser parseExpression: spec first. >>> self assert: node token source = spec first. >>> self assert: node value = spec second ] >>> >>> Lukas >>> >>> -- >>> Lukas Renggli >>> www.lukas-renggli.ch >>> >> >> >> >> -- >> Lukas Renggli >> www.lukas-renggli.ch >> >> _______________________________________________ >> Pharo-project mailing list >> Pharo-project(a)lists.gforge.inria.fr >> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >> > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project

April 29, 2010

Re: [Pharo-project] Legitimate syntax for # ... foo

by Nicolas Cellier

I don't think any other st dialect would accept that syntax but Squeak. It's just how the parser/scanner works now, but It wouldn't break much code IMO if we stop supporting these weirdnesses. Nicolas 2010/4/29 Lukas Renggli <renggli(a)gmail.com>: > Actually I didn't have all the latest code loaded in the open image. > There is more, hold your breath: > > testSymbolNumbers > Â Â Â Â #(('#1' 1) ('#12' 12) ('#12.3' 12.3) ('# 1' 1) ('##1' 1) ('#"bar"1' > 1)) do: [ :pair | > Â Â Â Â Â Â Â Â tree := RBParser parseExpression: pair first. > Â Â Â Â Â Â Â Â self assert: tree value = pair second. > Â Â Â Â Â Â Â Â self assert: tree start > 1. > Â Â Â Â Â Â Â Â self assert: tree stop = pair first size ] > > On 29 April 2010 21:12, Lukas Renggli <renggli(a)gmail.com> wrote: >>> # "helllooo" foo >>> >>> prints >>> #foo >>> >>> is this correct? >> >> Probably not, but the standard compiler accepts it. So I had to patch >> the parser of the refactoring engine to accept a whole series of >> degraded constructs. Below a small collection of tests documenting >> some of these strange things: >> >> testSymbolLiteral >> Â Â Â Â | tree | >> Â Â Â Â #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' #foo) >> ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') >> ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair >> | >> Â Â Â Â Â Â Â Â tree := RBParser parseExpression: pair first. >> Â Â Â Â Â Â Â Â self assert: tree value = pair second. >> Â Â Â Â Â Â Â Â self assert: tree start = 1. >> Â Â Â Â Â Â Â Â self assert: tree stop = pair first size ] >> >> testStatements >> Â Â Â Â | tree | >> Â Â Â Â #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | ..' >> 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. >> bar' 2 2)) do: [ :each | >> Â Â Â Â Â Â Â Â tree := RBParser parseExpression: each first. >> Â Â Â Â Â Â Â Â self assert: tree statements size = each second. >> Â Â Â Â Â Â Â Â self assert: tree periods size = each last ] >> >> testNumberParsing >> Â Â Â Â | numbers node | >> Â Â Â Â numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' -123) >> ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) >> ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) >> ('2r1e8' Â 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' >> -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). >> Â Â Â Â numbers do: [ :spec | >> Â Â Â Â Â Â Â Â node := RBParser parseExpression: spec first. >> Â Â Â Â Â Â Â Â self assert: node token source = spec first. >> Â Â Â Â Â Â Â Â self assert: node value = spec second ] >> >> Lukas >> >> -- >> Lukas Renggli >> www.lukas-renggli.ch >> > > > > -- > Lukas Renggli > www.lukas-renggli.ch > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project >

April 29, 2010

Re: [Pharo-project] Legitimate syntax for # ... foo

by StÃ©phane Ducasse

arghhhhhhhhhhhhhhhhhhhhhhh may be one day we should clean that too. > testSymbolLiteral > | tree | > #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' #foo) > ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') > ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair > | > tree := RBParser parseExpression: pair first. > self assert: tree value = pair second. > self assert: tree start = 1. > self assert: tree stop = pair first size ] the string and symbols mixture is not good. #'hkjh 3' is ok and all the rest looks ugly to me. > testStatements > | tree | > #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | ..' > 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. > bar' 2 2)) do: [ :each | > tree := RBParser parseExpression: each first. > self assert: tree statements size = each second. > self assert: tree periods size = each last ] > > testNumberParsing > | numbers node | > numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' -123) > ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) > ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) > ('2r1e8' 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' > -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). > numbers do: [ :spec | > node := RBParser parseExpression: spec first. > self assert: node token source = spec first. > self assert: node value = spec second ] > > Lukas > > -- > Lukas Renggli > www.lukas-renggli.ch > > _______________________________________________ > Pharo-project mailing list > Pharo-project(a)lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project

April 29, 2010

Re: [Pharo-project] [squeak-dev] Re: Menu Registries

by StÃ©phane Ducasse

> > > is so much more "complicated" than > > ------------------- > Editor class>>blinkingCursor > <preference: 'Blinking Text Cursor' > category: 'Morphic' > description: 'When true, the text cursor will blink.' > type: #Boolean> > ^ BlinkingCursor ifNil: [ true ] > ------------------- > > Well the former is executable and must be executable. The latter is not necessarily executable (but its good if it is, because one can locate the code that processes the specification) . So they're the same on that level. But the former can only be executable and isn't separated from the processing code, whereas the latter is separated. Yes this is clear we got that discussion long time ago and we are aware of the pros and the cons. At least as a language designer expert this is obvious to me. Now I do not want to argue again. The goal of setting is to have settings totally out of the code and only make sense in presence of an interpreter of them. So... > The former also only works in context (aBuilder) whereas the latter stands alone, and this ability to stand alone, as a specification, loosely coupled to the settings maintennance system is one thing that makes it simpler. It also clearly states the default value which the former doesn't. So I find the latter significantly easier to understand, and given I understand the method annotation system I find the mechanics not that much more complicated than the former's. We all understand perform: right? Yes now the key dimension is whether your vocabulary is fixed or not. When you have a fixed vocabulary then this is clear that the declarative syntax is the winner and the other one does not make sense. But for preferences it does not work. or you should have a much more lengthly key and interpret the arguments. > You prefer UI+domain mixing, we prefer UI separated from domain. > > I see the opposite. I see good separation in the latter example but I don't see the separation in the former. And BTW this is me trying to think critically, trying to keep happy feet in both the Pharo and Squeak (and eToys and Cuis and ....) camps, not trying to be tribal. Apologies in advance if expressing a contradictory view is taken as offensive. I will not add more. I think that we should favor declarative syntax as much as we can but not more. Stef

April 29, 2010

Re: [Pharo-project] Legitimate syntax for # ... foo

by Lukas Renggli

Actually I didn't have all the latest code loaded in the open image. There is more, hold your breath: testSymbolNumbers #(('#1' 1) ('#12' 12) ('#12.3' 12.3) ('# 1' 1) ('##1' 1) ('#"bar"1' 1)) do: [ :pair | tree := RBParser parseExpression: pair first. self assert: tree value = pair second. self assert: tree start > 1. self assert: tree stop = pair first size ] On 29 April 2010 21:12, Lukas Renggli <renggli(a)gmail.com> wrote: >> # "helllooo" foo >> >> prints >> #foo >> >> is this correct? > > Probably not, but the standard compiler accepts it. So I had to patch > the parser of the refactoring engine to accept a whole series of > degraded constructs. Below a small collection of tests documenting > some of these strange things: > > testSymbolLiteral > Â Â Â Â | tree | > Â Â Â Â #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' #foo) > ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') > ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair > | > Â Â Â Â Â Â Â Â tree := RBParser parseExpression: pair first. > Â Â Â Â Â Â Â Â self assert: tree value = pair second. > Â Â Â Â Â Â Â Â self assert: tree start = 1. > Â Â Â Â Â Â Â Â self assert: tree stop = pair first size ] > > testStatements > Â Â Â Â | tree | > Â Â Â Â #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | ..' > 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. > bar' 2 2)) do: [ :each | > Â Â Â Â Â Â Â Â tree := RBParser parseExpression: each first. > Â Â Â Â Â Â Â Â self assert: tree statements size = each second. > Â Â Â Â Â Â Â Â self assert: tree periods size = each last ] > > testNumberParsing > Â Â Â Â | numbers node | > Â Â Â Â numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' -123) > ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) > ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) > ('2r1e8' Â 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' > -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). > Â Â Â Â numbers do: [ :spec | > Â Â Â Â Â Â Â Â node := RBParser parseExpression: spec first. > Â Â Â Â Â Â Â Â self assert: node token source = spec first. > Â Â Â Â Â Â Â Â self assert: node value = spec second ] > > Lukas > > -- > Lukas Renggli > www.lukas-renggli.ch > -- Lukas Renggli www.lukas-renggli.ch

April 29, 2010

Re: [Pharo-project] Legitimate syntax for # ... foo

by Lukas Renggli

> # "helllooo" foo > > prints > #foo > > is this correct? Probably not, but the standard compiler accepts it. So I had to patch the parser of the refactoring engine to accept a whole series of degraded constructs. Below a small collection of tests documenting some of these strange things: testSymbolLiteral | tree | #(('# foo' #foo) ('#"bar"foo' #foo) ('##foo' #foo) ('###foo' #foo) ('#foo:' #foo:) ('#foo::' #'foo::') ('#foo::bar' #'foo::bar') ('#foo::bar:' #'foo::bar:') ('#foo::bar::' #'foo::bar::')) do: [ :pair | tree := RBParser parseExpression: pair first. self assert: tree value = pair second. self assert: tree start = 1. self assert: tree stop = pair first size ] testStatements | tree | #(('' 0 0) ('.' 0 1) ('| bar |' 0 0) ('| bar | .' 0 1) ('| bar | ..' 0 2) ('foo. bar' 2 1) ('foo. bar.' 2 2) ('foo. bar. .' 2 3) ('. foo. bar' 2 2)) do: [ :each | tree := RBParser parseExpression: each first. self assert: tree statements size = each second. self assert: tree periods size = each last ] testNumberParsing | numbers node | numbers := #(('1' 1) ('-1' -1) ('123' 123) ('123' 123) ('-123' -123) ('1.1' 1.1) ('-1.1' -1.1) ('1.23' 1.23) ('-1.23' -1.23) ('1e3' 1e3) ('1d3' 1d3) ('1q3' 1q3) ('-1e3' -1e3) ('1e-3' 1e-3) ('-1e-3' -1e-3) ('2r1e8' 2r1e8) ('-2r1e8' -2r1e8) ('2r1e-8' 2r1e-8) ('-2r1e-8' -2r1e-8) ('0.50s2' 0.50s2) ('0.500s3' 0.500s3) ('0.050s3' 0.050s3)). numbers do: [ :spec | node := RBParser parseExpression: spec first. self assert: node token source = spec first. self assert: node value = spec second ] Lukas -- Lukas Renggli www.lukas-renggli.ch

April 29, 2010