Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW

Re: please reply

by CountZero (Bishop)
on Jan 06, 2013 at 19:15 UTC ( #1011908=note: print w/replies, xml ) Need Help??

in reply to please reply

Could this be related to exercise 4.4 of exercise solutions (part of a Perl course taught at CNTS - Computational Linguistics at the University of Antwerp)?

The problem to solve is:

Write a program that reads text from standard input until end-of-file, and then prints the frequency of each bigram that occurs in the text. And this without hashes.
If that is indeed the "solution" to this problem, it is not working.


A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

My blog: Imperial Deltronics

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1011908]
[ovedpo15]: how to check with regex that string has ",0" (notice the comma) but it 0 is the last char. for example: "hey,0" = good, "a,0" = good, "a,01" = bad, "hey,010101" = bad
[ovedpo15]: also "hey,010" is bad. only ",0 *end of string*"
[choroba]: /,0$/

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (7)
As of 2018-03-20 07:43 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (248 votes). Check out past polls.