Informatics1-2019/HW3

A MathWikiből
A lap korábbi változatát látod, amilyen Gaebor (vitalap | szerkesztései) 2019. október 7., 13:38-kor történt szerkesztése után volt.

Tartalomjegyzék

Regex (3 points)

You have to write a regular expression matching a specific pattern. Use this page: https://regex101.com/ and don't forget to set python flavor.

The expression should find words containing only lowercase, latin characters.

  • A word should be matched if it uses only the same vowel every time
  • contains at least two vowels
  • It can start with any number of consonants, or a vowel.
  • two vowels should not be next to each other.
  • it should match a whole word only

Hint

For vowels you can use:

   [aeiou]

And for consonants:

   [^aeiou\s]

Example

These should be matched:

  • mammal
  • chlorophorm
  • oppo

these shuold not match:

  • mammut
  • choroid
  • opponent


Deadline

2019. October 13th 23:59

Személyes eszközök