Lex program to check whether given number is armstrong number or not

Problem: Lex program to check whether given number is armstrong number or not.

Lex is a computer program that generates lexical analyzers and was written by Mike Lesk and Eric Schmidt. Lex reads an input stream specifying the lexical analyzer and outputs source code implementing the lexer in the C programming language.

An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. For example, 153 is an Armstrong number,

(1^3) + (5^3) + (3^3) = 153 


Input: 153 
Output: 153 is a Armstrong number

Input: 250
Output: 250 is not a Armstrong number 






/* Lex program to check whether given 
    - number is armstrong number or not */
/* Definition section */
#include <math.h>
#include <string.h>
    void check(char*);
/* Rule Section */
% %
        [0 - 9]
    + check(yytext);
% % 
int main()
    /* yyin as pointer of File type */
    extern FILE* yyin;
    yyin = fopen("num", "r");
    // The function that starts the analysis
    return 0;
void check(char* a)
    int len = strlen(a), i, num = 0;
    for (i = 0; i < len; i++)
        num = num * 10 + (a[i] - '0');
    int x = 0, y = 0, temp = num;
    while (num > 0) {
        y = pow((num % 10), len);
        x = x + y;
        num = num / 10;
    if (x == temp)
        printf("%d is armstrong number \n", temp);
        printf("%d is not armstrong number\n", temp);



GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.